./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 12:42:14,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:42:14,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:42:14,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:42:14,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:42:14,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:42:14,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:42:14,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:42:14,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:42:15,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:42:15,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:42:15,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:42:15,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:42:15,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:42:15,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:42:15,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:42:15,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:42:15,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:42:15,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:42:15,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:42:15,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:42:15,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:42:15,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:42:15,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:42:15,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:42:15,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:42:15,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:42:15,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:42:15,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:42:15,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:42:15,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:42:15,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:42:15,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:42:15,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:42:15,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:42:15,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:42:15,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:42:15,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:42:15,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:42:15,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:42:15,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:42:15,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 12:42:15,075 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:42:15,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:42:15,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:42:15,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:42:15,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:42:15,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:42:15,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:42:15,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:42:15,079 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:42:15,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:42:15,080 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:42:15,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:42:15,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:42:15,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:42:15,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 12:42:15,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:42:15,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 12:42:15,081 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:42:15,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 12:42:15,082 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:42:15,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 12:42:15,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:42:15,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:42:15,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:42:15,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:42:15,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:42:15,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:42:15,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 12:42:15,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 12:42:15,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 12:42:15,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:42:15,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 12:42:15,085 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:42:15,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:42:15,086 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:42:15,086 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2023-02-15 12:42:15,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:42:15,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:42:15,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:42:15,377 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:42:15,377 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:42:15,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2023-02-15 12:42:16,451 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:42:16,673 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:42:16,673 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2023-02-15 12:42:16,679 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6b75f7f9/e83a1923dd8e4a32a6c1783e46b584ca/FLAG2c74ef2f7 [2023-02-15 12:42:16,698 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6b75f7f9/e83a1923dd8e4a32a6c1783e46b584ca [2023-02-15 12:42:16,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:42:16,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:42:16,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:42:16,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:42:16,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:42:16,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:16,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b667f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16, skipping insertion in model container [2023-02-15 12:42:16,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:16,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:42:16,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:42:16,857 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2023-02-15 12:42:16,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:42:16,905 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:42:16,913 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2023-02-15 12:42:16,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:42:16,966 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:42:16,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16 WrapperNode [2023-02-15 12:42:16,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:42:16,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:42:16,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:42:16,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:42:16,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:16,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:16,998 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2023-02-15 12:42:16,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:42:16,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:42:16,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:42:16,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:42:17,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,020 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:42:17,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:42:17,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:42:17,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:42:17,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (1/1) ... [2023-02-15 12:42:17,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:42:17,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:42:17,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 12:42:17,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 12:42:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:42:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 12:42:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 12:42:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 12:42:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2023-02-15 12:42:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2023-02-15 12:42:17,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 12:42:17,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 12:42:17,093 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2023-02-15 12:42:17,093 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2023-02-15 12:42:17,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:42:17,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:42:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 12:42:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-15 12:42:17,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-15 12:42:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 12:42:17,197 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:42:17,199 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:42:17,468 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:42:17,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:42:17,474 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 12:42:17,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:17 BoogieIcfgContainer [2023-02-15 12:42:17,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:42:17,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:42:17,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:42:17,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:42:17,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:42:16" (1/3) ... [2023-02-15 12:42:17,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459b8dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:42:17, skipping insertion in model container [2023-02-15 12:42:17,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:16" (2/3) ... [2023-02-15 12:42:17,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459b8dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:42:17, skipping insertion in model container [2023-02-15 12:42:17,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:17" (3/3) ... [2023-02-15 12:42:17,483 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2023-02-15 12:42:17,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:42:17,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 12:42:17,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:42:17,582 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a4ebc10, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:42:17,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 12:42:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 12:42:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 12:42:17,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:17,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:42:17,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2023-02-15 12:42:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:17,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507972364] [2023-02-15 12:42:17,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:42:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:17,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:42:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:17,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:42:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 12:42:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 12:42:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 12:42:17,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:17,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507972364] [2023-02-15 12:42:17,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507972364] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:42:17,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:42:17,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:42:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475404632] [2023-02-15 12:42:17,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:42:17,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:42:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:42:17,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:42:17,894 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 12:42:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:17,963 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2023-02-15 12:42:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:42:17,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-02-15 12:42:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:17,981 INFO L225 Difference]: With dead ends: 96 [2023-02-15 12:42:17,982 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 12:42:17,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:42:17,992 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:17,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:42:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 12:42:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-02-15 12:42:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 12:42:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2023-02-15 12:42:18,026 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2023-02-15 12:42:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:18,026 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2023-02-15 12:42:18,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 12:42:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2023-02-15 12:42:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 12:42:18,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:18,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:42:18,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 12:42:18,030 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:18,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2023-02-15 12:42:18,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:18,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571526595] [2023-02-15 12:42:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:18,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:42:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:42:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:42:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 12:42:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 12:42:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 12:42:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:18,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571526595] [2023-02-15 12:42:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571526595] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:42:18,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:42:18,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:42:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827660373] [2023-02-15 12:42:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:42:18,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 12:42:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:18,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 12:42:18,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 12:42:18,631 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 12:42:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:18,879 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2023-02-15 12:42:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 12:42:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-02-15 12:42:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:18,884 INFO L225 Difference]: With dead ends: 87 [2023-02-15 12:42:18,884 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 12:42:18,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-15 12:42:18,887 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:18,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 210 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:42:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 12:42:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2023-02-15 12:42:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 12:42:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2023-02-15 12:42:18,897 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2023-02-15 12:42:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:18,898 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2023-02-15 12:42:18,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 12:42:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2023-02-15 12:42:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 12:42:18,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:18,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:42:18,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 12:42:18,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2023-02-15 12:42:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:18,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406549116] [2023-02-15 12:42:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:42:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:42:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:42:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 12:42:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:42:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 12:42:19,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:19,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406549116] [2023-02-15 12:42:19,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406549116] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:42:19,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760569166] [2023-02-15 12:42:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:42:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:42:19,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:42:19,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 12:42:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 12:42:19,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:42:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 12:42:19,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:42:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 12:42:19,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760569166] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:42:19,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:42:19,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-15 12:42:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507336266] [2023-02-15 12:42:19,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:42:19,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 12:42:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 12:42:19,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-15 12:42:19,507 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 12:42:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:19,688 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2023-02-15 12:42:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:42:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46 [2023-02-15 12:42:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:19,690 INFO L225 Difference]: With dead ends: 73 [2023-02-15 12:42:19,690 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 12:42:19,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-02-15 12:42:19,691 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:19,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 252 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:42:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 12:42:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2023-02-15 12:42:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 12:42:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-02-15 12:42:19,698 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2023-02-15 12:42:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:19,699 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-02-15 12:42:19,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 12:42:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-02-15 12:42:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 12:42:19,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:19,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:42:19,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 12:42:19,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:42:19,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2023-02-15 12:42:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:19,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295476418] [2023-02-15 12:42:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:19,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:42:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:42:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:42:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 12:42:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 12:42:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 12:42:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:22,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295476418] [2023-02-15 12:42:22,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295476418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:42:22,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694046719] [2023-02-15 12:42:22,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 12:42:22,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:42:22,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:42:22,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:42:22,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 12:42:22,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 12:42:22,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:42:22,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-15 12:42:22,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:42:22,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 12:42:22,704 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_123 Int) (downsweep_~left Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_123) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) is different from true [2023-02-15 12:42:22,743 INFO L321 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-02-15 12:42:22,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 27 [2023-02-15 12:42:22,891 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 12:42:22,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 12:42:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 12:42:22,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:42:23,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694046719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:42:23,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 12:42:23,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 28 [2023-02-15 12:42:23,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211902668] [2023-02-15 12:42:23,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 12:42:23,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 12:42:23,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 12:42:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=772, Unknown=1, NotChecked=56, Total=930 [2023-02-15 12:42:23,186 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 28 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 12:42:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:26,267 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-15 12:42:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 12:42:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 48 [2023-02-15 12:42:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:26,271 INFO L225 Difference]: With dead ends: 82 [2023-02-15 12:42:26,271 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 12:42:26,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=356, Invalid=2197, Unknown=1, NotChecked=98, Total=2652 [2023-02-15 12:42:26,273 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 143 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:26,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 278 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 661 Invalid, 0 Unknown, 78 Unchecked, 0.8s Time] [2023-02-15 12:42:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 12:42:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2023-02-15 12:42:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2023-02-15 12:42:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2023-02-15 12:42:26,283 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 48 [2023-02-15 12:42:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:26,284 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2023-02-15 12:42:26,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 12:42:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2023-02-15 12:42:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 12:42:26,286 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:26,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:42:26,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 12:42:26,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 12:42:26,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash 736701521, now seen corresponding path program 1 times [2023-02-15 12:42:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:26,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811709632] [2023-02-15 12:42:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:42:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:42:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:42:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 12:42:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 12:42:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 12:42:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811709632] [2023-02-15 12:42:26,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811709632] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:42:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988813346] [2023-02-15 12:42:26,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:26,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:42:26,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:42:26,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:42:26,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 12:42:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:26,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 115 conjunts are in the unsatisfiable core [2023-02-15 12:42:26,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:42:26,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 12:42:26,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-15 12:42:26,973 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:42:26,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 12:42:27,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 12:42:27,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-15 12:42:27,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-15 12:42:27,317 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (upsweep_~a.offset Int) (v_ArrVal_177 Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (<= upsweep_~right (+ |c_upsweep_#in~left| 1)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_177))) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) is different from true [2023-02-15 12:42:27,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-02-15 12:42:27,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-02-15 12:42:27,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2023-02-15 12:42:28,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2023-02-15 12:42:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 12:42:28,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:43:05,157 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 59 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 12:43:05,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988813346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:43:05,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 12:43:05,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 28] total 35 [2023-02-15 12:43:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680136809] [2023-02-15 12:43:05,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 12:43:05,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 12:43:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:43:05,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 12:43:05,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1570, Unknown=13, NotChecked=80, Total=1806 [2023-02-15 12:43:05,161 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 35 states, 31 states have (on average 2.096774193548387) internal successors, (65), 29 states have internal predecessors, (65), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-02-15 12:43:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:43:11,789 INFO L93 Difference]: Finished difference Result 140 states and 178 transitions. [2023-02-15 12:43:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-15 12:43:11,789 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.096774193548387) internal successors, (65), 29 states have internal predecessors, (65), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 52 [2023-02-15 12:43:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:43:11,791 INFO L225 Difference]: With dead ends: 140 [2023-02-15 12:43:11,791 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 12:43:11,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=779, Invalid=6316, Unknown=49, NotChecked=166, Total=7310 [2023-02-15 12:43:11,794 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 252 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 12:43:11,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1356 Invalid, 0 Unknown, 107 Unchecked, 1.5s Time] [2023-02-15 12:43:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 12:43:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2023-02-15 12:43:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 62 states have internal predecessors, (68), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2023-02-15 12:43:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2023-02-15 12:43:11,815 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 52 [2023-02-15 12:43:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:43:11,815 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2023-02-15 12:43:11,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.096774193548387) internal successors, (65), 29 states have internal predecessors, (65), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-02-15 12:43:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2023-02-15 12:43:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 12:43:11,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:43:11,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:43:11,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 12:43:12,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:12,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:43:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:43:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 2 times [2023-02-15 12:43:12,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:43:12,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321092978] [2023-02-15 12:43:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:43:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:43:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:43:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:43:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 12:43:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:12,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 12:43:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 12:43:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:43:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321092978] [2023-02-15 12:43:12,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321092978] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:43:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252373612] [2023-02-15 12:43:12,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 12:43:12,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:12,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:43:12,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:43:12,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 12:43:12,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 12:43:12,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:43:12,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 12:43:12,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:43:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 12:43:12,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:43:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 12:43:12,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252373612] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:43:12,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:43:12,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2023-02-15 12:43:12,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755467273] [2023-02-15 12:43:12,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:43:12,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 12:43:12,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:43:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 12:43:12,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-15 12:43:12,505 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-15 12:43:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:43:12,777 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2023-02-15 12:43:12,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 12:43:12,778 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2023-02-15 12:43:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:43:12,779 INFO L225 Difference]: With dead ends: 113 [2023-02-15 12:43:12,779 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 12:43:12,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-02-15 12:43:12,780 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 41 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:43:12,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 310 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:43:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 12:43:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2023-02-15 12:43:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2023-02-15 12:43:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2023-02-15 12:43:12,798 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 54 [2023-02-15 12:43:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:43:12,799 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2023-02-15 12:43:12,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-15 12:43:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2023-02-15 12:43:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 12:43:12,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:43:12,801 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:43:12,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 12:43:13,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:13,006 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:43:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:43:13,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 1 times [2023-02-15 12:43:13,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:43:13,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103556511] [2023-02-15 12:43:13,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:13,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:43:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 12:43:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 12:43:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:43:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 12:43:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-15 12:43:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 12:43:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:43:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103556511] [2023-02-15 12:43:13,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103556511] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:43:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111828011] [2023-02-15 12:43:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:13,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:43:13,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:43:13,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 12:43:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:13,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 12:43:13,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:43:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 12:43:13,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:43:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 12:43:13,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111828011] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:43:13,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:43:13,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2023-02-15 12:43:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892942271] [2023-02-15 12:43:13,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:43:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 12:43:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:43:13,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 12:43:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-15 12:43:13,468 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 12:43:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:43:13,782 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2023-02-15 12:43:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 12:43:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2023-02-15 12:43:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:43:13,784 INFO L225 Difference]: With dead ends: 122 [2023-02-15 12:43:13,784 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 12:43:13,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-02-15 12:43:13,785 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:43:13,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 468 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:43:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 12:43:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2023-02-15 12:43:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 61 states have internal predecessors, (68), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2023-02-15 12:43:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2023-02-15 12:43:13,805 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 57 [2023-02-15 12:43:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:43:13,805 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2023-02-15 12:43:13,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 12:43:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2023-02-15 12:43:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 12:43:13,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:43:13,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:43:13,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 12:43:14,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:14,013 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:43:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:43:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1099509749, now seen corresponding path program 1 times [2023-02-15 12:43:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:43:14,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193060087] [2023-02-15 12:43:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:43:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 12:43:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 12:43:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:43:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 12:43:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 12:43:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 12:43:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 12:43:14,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:43:14,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193060087] [2023-02-15 12:43:14,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193060087] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:43:14,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935861145] [2023-02-15 12:43:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:14,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:14,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:43:14,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:43:14,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 12:43:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:14,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 12:43:14,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:43:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 12:43:14,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:43:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 12:43:14,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935861145] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:43:14,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:43:14,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-02-15 12:43:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876545362] [2023-02-15 12:43:14,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:43:14,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 12:43:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:43:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 12:43:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-02-15 12:43:14,663 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-15 12:43:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:43:14,884 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2023-02-15 12:43:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 12:43:14,885 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 65 [2023-02-15 12:43:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:43:14,886 INFO L225 Difference]: With dead ends: 93 [2023-02-15 12:43:14,886 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 12:43:14,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-02-15 12:43:14,887 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:43:14,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 364 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:43:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 12:43:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2023-02-15 12:43:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-15 12:43:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2023-02-15 12:43:14,900 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 65 [2023-02-15 12:43:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:43:14,902 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2023-02-15 12:43:14,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-15 12:43:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2023-02-15 12:43:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 12:43:14,904 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:43:14,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:43:14,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 12:43:15,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:15,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:43:15,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:43:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2023-02-15 12:43:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:43:15,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001611762] [2023-02-15 12:43:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:43:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:43:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:43:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:43:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 12:43:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 12:43:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-15 12:43:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 12:43:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-15 12:43:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:43:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001611762] [2023-02-15 12:43:15,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001611762] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:43:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772785979] [2023-02-15 12:43:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:43:15,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:43:15,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 12:43:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:15,583 WARN L261 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 176 conjunts are in the unsatisfiable core [2023-02-15 12:43:15,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:43:15,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 12:43:15,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-15 12:43:15,745 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:43:15,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 12:43:15,771 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_417 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_417) |c_#memory_int|)) is different from true [2023-02-15 12:43:15,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 12:43:15,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 12:43:15,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 12:43:15,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 12:43:16,068 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_421 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_421)) |c_#memory_int|)) is different from true [2023-02-15 12:43:16,148 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_423 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_423)) |c_#memory_int|)) is different from true [2023-02-15 12:43:16,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_421 Int) (v_ArrVal_426 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* 4 |c_upsweep_#in~left|)) v_ArrVal_421) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_426)) |c_#memory_int|)) is different from true [2023-02-15 12:43:16,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-02-15 12:43:16,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-02-15 12:43:16,465 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_432 Int) (downsweep_~left Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_432)))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2023-02-15 12:43:16,596 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (downsweep_~right Int) (v_ArrVal_437 Int) (downsweep_~a.offset Int) (v_ArrVal_435 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_435) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_437)) |c_#memory_int|) (<= |c_downsweep_#in~right| downsweep_~right) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2023-02-15 12:43:18,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 121 [2023-02-15 12:43:19,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 141 [2023-02-15 12:43:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 17 not checked. [2023-02-15 12:43:19,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:43:21,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772785979] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:43:21,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 12:43:21,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 37] total 46 [2023-02-15 12:43:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242940877] [2023-02-15 12:43:21,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 12:43:21,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 12:43:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:43:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 12:43:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1769, Unknown=7, NotChecked=534, Total=2450 [2023-02-15 12:43:21,955 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 46 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2023-02-15 12:43:26,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 12:43:29,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 12:43:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:43:38,964 INFO L93 Difference]: Finished difference Result 139 states and 188 transitions. [2023-02-15 12:43:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-15 12:43:38,965 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) Word has length 72 [2023-02-15 12:43:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:43:38,966 INFO L225 Difference]: With dead ends: 139 [2023-02-15 12:43:38,967 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 12:43:38,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=720, Invalid=7126, Unknown=10, NotChecked=1074, Total=8930 [2023-02-15 12:43:38,970 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 239 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 149 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-02-15 12:43:38,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 487 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1870 Invalid, 2 Unknown, 600 Unchecked, 7.4s Time] [2023-02-15 12:43:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 12:43:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2023-02-15 12:43:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 62 states have internal predecessors, (67), 17 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2023-02-15 12:43:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2023-02-15 12:43:38,990 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 72 [2023-02-15 12:43:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:43:38,991 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2023-02-15 12:43:38,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 13 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2023-02-15 12:43:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2023-02-15 12:43:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 12:43:38,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:43:38,993 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:43:39,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 12:43:39,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:43:39,201 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:43:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:43:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2023-02-15 12:43:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:43:39,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844600175] [2023-02-15 12:43:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:43:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:43:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 12:43:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:43:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:43:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 12:43:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:43:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 12:43:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:43:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 12:43:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat