./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -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 --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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:51:26,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:51:26,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:51:26,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:51:26,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:51:26,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:51:26,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:51:26,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:51:26,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:51:26,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:51:26,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:51:26,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:51:26,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:51:26,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:51:26,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:51:26,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:51:26,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:51:26,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:51:26,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:51:26,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:51:26,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:51:26,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:51:26,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:51:26,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:51:26,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:51:26,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:51:26,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:51:26,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:51:26,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:51:26,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:51:26,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:51:26,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:51:26,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:51:26,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:51:26,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:51:26,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:51:26,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:51:26,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:51:26,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:51:26,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:51:26,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:51:26,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:51:26,331 INFO L153 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 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-19 20:51:26,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:51:26,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:51:26,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:51:26,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:51:26,576 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:51:26,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-19 20:51:27,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:51:27,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:51:27,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-19 20:51:27,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9665016ce/aeffa927af6b4171bc4418f151e7011c/FLAG632f1a556 [2024-11-19 20:51:27,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9665016ce/aeffa927af6b4171bc4418f151e7011c [2024-11-19 20:51:27,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:51:27,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:51:27,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:51:27,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:51:27,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:51:27,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:27" (1/1) ... [2024-11-19 20:51:27,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1660bb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:27, skipping insertion in model container [2024-11-19 20:51:27,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:27" (1/1) ... [2024-11-19 20:51:28,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:51:28,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-19 20:51:28,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:51:28,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:51:28,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-19 20:51:28,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:51:28,347 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:51:28,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28 WrapperNode [2024-11-19 20:51:28,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:51:28,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:51:28,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:51:28,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:51:28,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,382 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-11-19 20:51:28,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:51:28,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:51:28,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:51:28,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:51:28,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,407 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-19 20:51:28,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:51:28,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:51:28,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:51:28,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:51:28,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:51:28,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:28,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:51:28,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:51:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:51:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:51:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:51:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 20:51:28,485 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:51:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:51:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:51:28,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:51:28,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:51:28,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:51:28,741 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-19 20:51:28,741 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:51:28,752 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:51:28,753 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 20:51:28,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:28 BoogieIcfgContainer [2024-11-19 20:51:28,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:51:28,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:51:28,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:51:28,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:51:28,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:51:27" (1/3) ... [2024-11-19 20:51:28,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f9ce00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:28, skipping insertion in model container [2024-11-19 20:51:28,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (2/3) ... [2024-11-19 20:51:28,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f9ce00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:28, skipping insertion in model container [2024-11-19 20:51:28,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:28" (3/3) ... [2024-11-19 20:51:28,759 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-19 20:51:28,772 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:51:28,773 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:51:28,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:51:28,825 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@31587ba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:51:28,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:51:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 20:51:28,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:28,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:28,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:28,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 535821778, now seen corresponding path program 1 times [2024-11-19 20:51:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:28,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281157493] [2024-11-19 20:51:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:51:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281157493] [2024-11-19 20:51:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281157493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:29,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:51:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:51:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636742797] [2024-11-19 20:51:29,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:51:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:29,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:51:29,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:51:29,087 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:29,123 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-11-19 20:51:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:51:29,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 20:51:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:29,132 INFO L225 Difference]: With dead ends: 50 [2024-11-19 20:51:29,132 INFO L226 Difference]: Without dead ends: 22 [2024-11-19 20:51:29,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:51:29,138 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:29,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-19 20:51:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 20:51:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-19 20:51:29,162 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-19 20:51:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:29,162 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 20:51:29,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-19 20:51:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 20:51:29,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:29,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:29,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:51:29,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1411921462, now seen corresponding path program 1 times [2024-11-19 20:51:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096395221] [2024-11-19 20:51:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:51:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096395221] [2024-11-19 20:51:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096395221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:29,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:51:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:51:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046868251] [2024-11-19 20:51:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:29,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:51:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:51:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:51:29,326 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:29,359 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-19 20:51:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:51:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 20:51:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:29,360 INFO L225 Difference]: With dead ends: 42 [2024-11-19 20:51:29,360 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 20:51:29,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:51:29,363 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:29,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 20:51:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-19 20:51:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-19 20:51:29,371 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-11-19 20:51:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:29,372 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-19 20:51:29,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-19 20:51:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 20:51:29,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:29,373 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:51:29,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:29,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:29,374 INFO L85 PathProgramCache]: Analyzing trace with hash 340179466, now seen corresponding path program 1 times [2024-11-19 20:51:29,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256801993] [2024-11-19 20:51:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 20:51:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256801993] [2024-11-19 20:51:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256801993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:29,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281603779] [2024-11-19 20:51:29,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:29,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:29,560 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) [2024-11-19 20:51:29,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:51:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:51:29,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:29,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281603779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:51:29,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:51:29,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-19 20:51:29,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768822932] [2024-11-19 20:51:29,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:29,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:51:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:51:29,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:51:29,765 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:51:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:29,816 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-19 20:51:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:51:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-19 20:51:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:29,817 INFO L225 Difference]: With dead ends: 43 [2024-11-19 20:51:29,818 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 20:51:29,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:51:29,819 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:29,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 20:51:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 20:51:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:51:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-19 20:51:29,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 24 [2024-11-19 20:51:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:29,827 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-19 20:51:29,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:51:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-19 20:51:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 20:51:29,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:29,828 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:29,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 20:51:30,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:30,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:30,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash 872550858, now seen corresponding path program 2 times [2024-11-19 20:51:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225840854] [2024-11-19 20:51:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 20:51:30,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:30,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225840854] [2024-11-19 20:51:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225840854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:51:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 20:51:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621119650] [2024-11-19 20:51:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:30,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 20:51:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 20:51:30,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:51:30,564 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:30,652 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-19 20:51:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:51:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-19 20:51:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:30,654 INFO L225 Difference]: With dead ends: 29 [2024-11-19 20:51:30,654 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 20:51:30,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:51:30,655 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:30,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:51:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 20:51:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 20:51:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:51:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-19 20:51:30,659 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2024-11-19 20:51:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:30,659 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-19 20:51:30,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-19 20:51:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 20:51:30,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:30,660 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 20:51:30,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:30,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1002784155, now seen corresponding path program 1 times [2024-11-19 20:51:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473859100] [2024-11-19 20:51:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:31,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473859100] [2024-11-19 20:51:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473859100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:31,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557289148] [2024-11-19 20:51:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:31,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:31,275 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) [2024-11-19 20:51:31,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:51:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-19 20:51:31,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:31,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-19 20:51:31,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 20:51:31,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 4 [2024-11-19 20:51:31,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2024-11-19 20:51:31,703 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:51:31,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-19 20:51:31,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-19 20:51:31,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2024-11-19 20:51:31,822 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-19 20:51:31,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 94 [2024-11-19 20:51:31,841 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-19 20:51:31,842 INFO L378 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 1 case distinctions, treesize of input 30 treesize of output 22 [2024-11-19 20:51:36,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:36,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 212 treesize of output 300 [2024-11-19 20:51:36,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:36,234 INFO L378 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 148 treesize of output 124 [2024-11-19 20:51:36,848 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-19 20:51:36,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 72 [2024-11-19 20:51:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:51:36,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:40,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:40,987 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-19 20:51:41,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557289148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:41,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 27 [2024-11-19 20:51:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574839051] [2024-11-19 20:51:41,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:41,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 20:51:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 20:51:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=795, Unknown=3, NotChecked=0, Total=870 [2024-11-19 20:51:41,060 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:51:45,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:51:53,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:51:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:53,693 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-19 20:51:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:51:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2024-11-19 20:51:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:53,695 INFO L225 Difference]: With dead ends: 37 [2024-11-19 20:51:53,695 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 20:51:53,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=133, Invalid=1423, Unknown=4, NotChecked=0, Total=1560 [2024-11-19 20:51:53,696 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:53,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 413 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-19 20:51:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 20:51:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-19 20:51:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:51:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-19 20:51:53,708 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 35 [2024-11-19 20:51:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:53,709 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-19 20:51:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:51:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-19 20:51:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 20:51:53,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:53,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:53,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:53,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:53,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:53,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1002785829, now seen corresponding path program 1 times [2024-11-19 20:51:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:53,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355259549] [2024-11-19 20:51:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:54,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:54,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355259549] [2024-11-19 20:51:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355259549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:54,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383352613] [2024-11-19 20:51:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:54,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:54,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:54,854 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) [2024-11-19 20:51:54,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:51:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:54,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-19 20:51:54,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:55,007 INFO L378 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 [2024-11-19 20:51:55,019 INFO L378 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 11 treesize of output 7 [2024-11-19 20:51:55,063 INFO L378 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 23 treesize of output 11 [2024-11-19 20:51:55,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-11-19 20:51:55,170 INFO L378 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 11 treesize of output 3 [2024-11-19 20:51:55,287 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:51:55,288 INFO L378 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 15 treesize of output 15 [2024-11-19 20:51:55,292 INFO L378 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 20 treesize of output 15 [2024-11-19 20:51:55,350 INFO L378 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 25 treesize of output 17 [2024-11-19 20:51:55,369 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-19 20:51:55,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-19 20:51:55,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-19 20:51:55,385 INFO L378 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 60 treesize of output 33 [2024-11-19 20:51:55,390 INFO L378 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 38 treesize of output 25 [2024-11-19 20:51:55,435 INFO L378 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 68 treesize of output 48 [2024-11-19 20:51:55,437 INFO L378 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 52 treesize of output 36 [2024-11-19 20:51:55,488 INFO L378 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 33 treesize of output 15 [2024-11-19 20:51:55,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-19 20:51:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:55,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:55,673 INFO L378 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 208 treesize of output 178 [2024-11-19 20:51:55,675 INFO L378 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 314 treesize of output 254 [2024-11-19 20:51:55,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse1 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse3 (forall ((v_ArrVal_625 (Array Int Int)) (v_arrayElimCell_38 Int) (v_arrayElimCell_37 Int)) (let ((.cse11 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_625) v_arrayElimCell_37))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 v_arrayElimCell_38)))))) (.cse0 (forall ((v_ArrVal_625 (Array Int Int)) (v_arrayElimCell_38 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_625) v_arrayElimCell_37) v_arrayElimCell_38)))) (.cse2 (forall ((v_ArrVal_627 Int)) (= v_ArrVal_627 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse5 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or (forall ((v_ArrVal_627 Int)) (not (= v_ArrVal_627 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_627)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not .cse1) (forall ((v_ArrVal_625 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_625) .cse5) .cse6)))) (or .cse1 .cse3) (or .cse0 .cse2) (forall ((v_ArrVal_625 (Array Int Int)) (v_arrayElimCell_38 Int) (v_arrayElimCell_37 Int)) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_625))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_arrayElimCell_37) v_arrayElimCell_38))))) (forall ((v_ArrVal_625 (Array Int Int)) (v_arrayElimCell_38 Int) (v_arrayElimCell_37 Int)) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_625))) (let ((.cse9 (select .cse8 v_arrayElimCell_37))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_arrayElimCell_38)))))))))) is different from false [2024-11-19 20:51:56,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383352613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:56,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:56,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-19 20:51:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244613407] [2024-11-19 20:51:56,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:56,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 20:51:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 20:51:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1043, Unknown=1, NotChecked=64, Total=1190 [2024-11-19 20:51:56,079 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:51:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:56,697 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-19 20:51:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:51:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2024-11-19 20:51:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:56,698 INFO L225 Difference]: With dead ends: 38 [2024-11-19 20:51:56,698 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:51:56,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=2006, Unknown=1, NotChecked=90, Total=2256 [2024-11-19 20:51:56,700 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:56,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 250 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:51:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:51:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-19 20:51:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:51:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-19 20:51:56,705 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 35 [2024-11-19 20:51:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:56,706 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-19 20:51:56,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:51:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-19 20:51:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:51:56,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:56,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:56,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:51:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:56,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1604539702, now seen corresponding path program 1 times [2024-11-19 20:51:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37035131] [2024-11-19 20:51:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:57,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:57,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:57,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37035131] [2024-11-19 20:51:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37035131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292485976] [2024-11-19 20:51:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:57,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:57,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:57,724 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) [2024-11-19 20:51:57,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:51:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:57,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-19 20:51:57,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:57,852 INFO L378 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 [2024-11-19 20:51:57,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:51:57,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-11-19 20:51:57,912 INFO L378 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 12 treesize of output 4 [2024-11-19 20:51:58,043 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:51:58,043 INFO L378 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 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-19 20:51:58,055 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:51:58,056 INFO L378 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 15 treesize of output 15 [2024-11-19 20:51:58,098 INFO L378 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 42 treesize of output 37 [2024-11-19 20:51:58,100 INFO L378 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 61 treesize of output 34 [2024-11-19 20:51:58,105 INFO L378 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 25 treesize of output 17 [2024-11-19 20:51:58,121 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-19 20:51:58,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-19 20:51:58,157 INFO L378 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 69 treesize of output 49 [2024-11-19 20:51:58,159 INFO L378 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 53 treesize of output 37 [2024-11-19 20:51:58,193 INFO L378 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 9 treesize of output 3 [2024-11-19 20:51:58,235 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:51:58,235 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2024-11-19 20:51:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:51:58,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:58,319 INFO L378 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 236 treesize of output 206 [2024-11-19 20:51:58,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:58,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2024-11-19 20:51:58,716 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-19 20:51:58,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-19 20:51:58,767 INFO L349 Elim1Store]: treesize reduction 98, result has 14.8 percent of original size [2024-11-19 20:51:58,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 222 treesize of output 183 [2024-11-19 20:51:58,810 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-19 20:51:58,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 8 [2024-11-19 20:51:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292485976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:59,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:59,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2024-11-19 20:51:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054634138] [2024-11-19 20:51:59,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 20:51:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:59,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 20:51:59,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 20:51:59,138 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 22 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:51:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:59,788 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-19 20:51:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 20:51:59,788 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 22 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-19 20:51:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:59,789 INFO L225 Difference]: With dead ends: 39 [2024-11-19 20:51:59,789 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:51:59,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2024-11-19 20:51:59,790 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:59,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 380 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:51:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:51:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-19 20:51:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:51:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-19 20:51:59,795 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 37 [2024-11-19 20:51:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:59,795 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-19 20:51:59,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 22 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:51:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-19 20:51:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:51:59,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:59,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:59,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:51:59,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:59,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:59,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1604541376, now seen corresponding path program 1 times [2024-11-19 20:51:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689665503] [2024-11-19 20:51:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:52:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:52:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:52:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:01,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:52:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:52:01,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:52:01,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689665503] [2024-11-19 20:52:01,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689665503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:01,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945855572] [2024-11-19 20:52:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:01,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:01,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:01,449 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) [2024-11-19 20:52:01,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:52:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:01,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 148 conjuncts are in the unsatisfiable core [2024-11-19 20:52:01,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:01,613 INFO L378 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 [2024-11-19 20:52:01,622 INFO L378 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 11 treesize of output 7 [2024-11-19 20:52:01,674 INFO L378 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 23 treesize of output 11 [2024-11-19 20:52:01,814 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:52:01,815 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 20:52:01,832 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:52:01,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:52:01,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:52:01,894 INFO L378 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 11 treesize of output 7 [2024-11-19 20:52:01,899 INFO L378 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 20 treesize of output 15 [2024-11-19 20:52:02,127 INFO L378 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 45 treesize of output 21 [2024-11-19 20:52:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2024-11-19 20:52:02,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-19 20:52:02,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-19 20:52:02,370 INFO L349 Elim1Store]: treesize reduction 75, result has 23.5 percent of original size [2024-11-19 20:52:02,370 INFO L378 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 1 case distinctions, treesize of input 32 treesize of output 36 [2024-11-19 20:52:02,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:02,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-11-19 20:52:02,402 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-19 20:52:02,402 INFO L378 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-19 20:52:02,423 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:52:02,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 20:52:02,533 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-19 20:52:02,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-19 20:52:02,538 INFO L378 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 94 treesize of output 59 [2024-11-19 20:52:02,542 INFO L378 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 107 treesize of output 64 [2024-11-19 20:52:02,548 INFO L378 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 64 treesize of output 45 [2024-11-19 20:52:02,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-19 20:52:02,622 INFO L378 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 155 treesize of output 115 [2024-11-19 20:52:02,625 INFO L378 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 119 treesize of output 87 [2024-11-19 20:52:02,788 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:52:02,788 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 44 [2024-11-19 20:52:02,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-19 20:52:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:52:02,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:03,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945855572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:03,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:52:03,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2024-11-19 20:52:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001401108] [2024-11-19 20:52:03,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:03,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-19 20:52:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:52:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 20:52:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2226, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 20:52:03,783 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:52:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:05,279 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-19 20:52:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 20:52:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-19 20:52:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:05,280 INFO L225 Difference]: With dead ends: 42 [2024-11-19 20:52:05,280 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 20:52:05,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=269, Invalid=4153, Unknown=0, NotChecked=0, Total=4422 [2024-11-19 20:52:05,281 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:05,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 402 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 20:52:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 20:52:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-19 20:52:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:52:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-19 20:52:05,287 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 37 [2024-11-19 20:52:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-19 20:52:05,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.4) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:52:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-19 20:52:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 20:52:05,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:05,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:05,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 20:52:05,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:05,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:05,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:05,490 INFO L85 PathProgramCache]: Analyzing trace with hash 71035409, now seen corresponding path program 2 times [2024-11-19 20:52:05,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:52:05,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353235921] [2024-11-19 20:52:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:05,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:52:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:52:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:52:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:52:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:52:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:52:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353235921] [2024-11-19 20:52:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353235921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916731481] [2024-11-19 20:52:05,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:52:05,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:05,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:05,646 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) [2024-11-19 20:52:05,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:52:05,780 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:52:05,781 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:05,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 20:52:05,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 20:52:05,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 20:52:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916731481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:52:05,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:52:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2024-11-19 20:52:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475789469] [2024-11-19 20:52:05,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:05,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 20:52:05,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:52:05,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 20:52:05,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:52:05,866 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:52:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:05,925 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-19 20:52:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:52:05,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-19 20:52:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:05,926 INFO L225 Difference]: With dead ends: 45 [2024-11-19 20:52:05,926 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 20:52:05,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:52:05,927 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:05,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 142 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:52:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 20:52:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-11-19 20:52:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:52:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-19 20:52:05,932 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 39 [2024-11-19 20:52:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:05,933 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-19 20:52:05,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:52:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-19 20:52:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 20:52:05,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:05,934 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:05,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 20:52:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:06,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 71037083, now seen corresponding path program 2 times [2024-11-19 20:52:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:52:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803772136] [2024-11-19 20:52:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:52:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:07,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:52:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:07,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:52:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:52:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:52:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:52:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803772136] [2024-11-19 20:52:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803772136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966085726] [2024-11-19 20:52:07,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:52:07,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:07,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:07,661 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) [2024-11-19 20:52:07,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:52:07,826 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:52:07,827 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:07,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-19 20:52:07,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:07,864 INFO L378 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 [2024-11-19 20:52:07,901 INFO L378 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 11 treesize of output 7 [2024-11-19 20:52:07,905 INFO L378 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 11 treesize of output 7 [2024-11-19 20:52:08,075 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:52:08,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:52:08,082 INFO L378 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 16 treesize of output 11 [2024-11-19 20:52:08,085 INFO L378 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 16 treesize of output 11 [2024-11-19 20:52:08,129 INFO L378 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 23 treesize of output 22 [2024-11-19 20:52:08,136 INFO L378 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 27 treesize of output 15 [2024-11-19 20:52:08,291 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:52:08,291 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-19 20:52:08,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2024-11-19 20:52:08,302 INFO L378 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 19 treesize of output 7 [2024-11-19 20:52:08,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:08,478 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 20:52:08,479 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-19 20:52:08,491 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:52:08,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 20:52:08,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-19 20:52:08,586 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-19 20:52:08,587 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-19 20:52:08,590 INFO L378 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 116 treesize of output 69 [2024-11-19 20:52:08,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:08,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-19 20:52:08,610 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-19 20:52:08,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:52:08,678 INFO L378 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 116 treesize of output 80 [2024-11-19 20:52:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:52:09,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:09,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:52:09,370 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2024-11-19 20:52:09,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:52:09,374 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2024-11-19 20:52:09,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966085726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:09,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:52:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2024-11-19 20:52:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467449640] [2024-11-19 20:52:09,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:09,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 20:52:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:52:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 20:52:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2416, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 20:52:09,579 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 44 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 35 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:52:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:10,669 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-19 20:52:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 20:52:10,669 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 35 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-19 20:52:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:10,670 INFO L225 Difference]: With dead ends: 64 [2024-11-19 20:52:10,671 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 20:52:10,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=226, Invalid=3934, Unknown=0, NotChecked=0, Total=4160 [2024-11-19 20:52:10,673 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:10,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 398 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 20:52:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 20:52:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-19 20:52:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:52:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-19 20:52:10,687 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 39 [2024-11-19 20:52:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:10,687 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-19 20:52:10,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 35 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:52:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-19 20:52:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 20:52:10,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:10,688 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:10,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 20:52:10,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:10,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:10,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash -689037093, now seen corresponding path program 3 times [2024-11-19 20:52:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:52:10,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221919205] [2024-11-19 20:52:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:52:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:52:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:52:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:10,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 20:52:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 20:52:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 20:52:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:52:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221919205] [2024-11-19 20:52:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221919205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726034898] [2024-11-19 20:52:10,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 20:52:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:10,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:52:10,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 20:52:11,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 20:52:11,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:11,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 20:52:11,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:52:11,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:52:11,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726034898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:52:11,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:52:11,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-19 20:52:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548900050] [2024-11-19 20:52:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:52:11,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:52:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:52:11,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:52:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:52:11,466 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:52:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:11,475 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-19 20:52:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:52:11,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-19 20:52:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:11,476 INFO L225 Difference]: With dead ends: 46 [2024-11-19 20:52:11,476 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 20:52:11,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:52:11,476 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:11,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:52:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 20:52:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 20:52:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:52:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 20:52:11,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2024-11-19 20:52:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:11,477 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 20:52:11,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:52:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 20:52:11,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 20:52:11,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 20:52:11,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 20:52:11,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 20:52:11,684 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2024-11-19 20:52:11,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 20:52:20,328 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 112 DAG size of output: 62 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-19 20:52:20,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 20:52:20,347 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,348 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,348 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,349 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,349 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,349 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,349 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-19 20:52:20,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-19 20:52:20,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:52:20,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:52:20,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-19 20:52:20,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-19 20:52:20,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-19 20:52:20,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-19 20:52:20,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 20:52:20,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,361 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-19 20:52:20,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-19 20:52:20,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:52:20,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:52:20,363 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-19 20:52:20,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:52:20,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-19 20:52:20,367 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,367 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-19 20:52:20,367 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-19 20:52:20,367 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,367 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-19 20:52:20,367 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-19 20:52:20,369 WARN L156 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-19 20:52:20,373 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-19 20:52:20,374 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,374 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:52:20,374 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-11-19 20:52:20,374 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-19 20:52:20,374 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-19 20:52:20,374 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#res!base,]]] [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-19 20:52:20,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,376 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-19 20:52:20,376 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-19 20:52:20,376 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-19 20:52:20,376 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 20:52:20,376 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-19 20:52:20,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-19 20:52:20,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-19 20:52:20,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-19 20:52:20,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:52:20 BoogieIcfgContainer [2024-11-19 20:52:20,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 20:52:20,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 20:52:20,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 20:52:20,381 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 20:52:20,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:28" (3/4) ... [2024-11-19 20:52:20,383 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 20:52:20,386 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-19 20:52:20,389 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 20:52:20,393 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 20:52:20,393 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 20:52:20,393 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 20:52:20,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 20:52:20,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 20:52:20,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 20:52:20,473 INFO L158 Benchmark]: Toolchain (without parser) took 52498.67ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 144.0MB in the beginning and 150.2MB in the end (delta: -6.2MB). Peak memory consumption was 194.3MB. Max. memory is 16.1GB. [2024-11-19 20:52:20,474 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 72.4MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:52:20,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.33ms. Allocated memory is still 182.5MB. Free memory was 144.0MB in the beginning and 123.6MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 20:52:20,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.85ms. Allocated memory is still 182.5MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:52:20,474 INFO L158 Benchmark]: Boogie Preprocessor took 41.03ms. Allocated memory is still 182.5MB. Free memory was 121.5MB in the beginning and 118.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:52:20,474 INFO L158 Benchmark]: RCFGBuilder took 328.40ms. Allocated memory is still 182.5MB. Free memory was 118.8MB in the beginning and 141.9MB in the end (delta: -23.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 20:52:20,475 INFO L158 Benchmark]: TraceAbstraction took 51624.97ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 141.1MB in the beginning and 155.4MB in the end (delta: -14.4MB). Peak memory consumption was 188.6MB. Max. memory is 16.1GB. [2024-11-19 20:52:20,475 INFO L158 Benchmark]: Witness Printer took 93.31ms. Allocated memory is still 383.8MB. Free memory was 155.4MB in the beginning and 150.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 20:52:20,478 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 72.4MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.33ms. Allocated memory is still 182.5MB. Free memory was 144.0MB in the beginning and 123.6MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.85ms. Allocated memory is still 182.5MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.03ms. Allocated memory is still 182.5MB. Free memory was 121.5MB in the beginning and 118.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 328.40ms. Allocated memory is still 182.5MB. Free memory was 118.8MB in the beginning and 141.9MB in the end (delta: -23.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 51624.97ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 141.1MB in the beginning and 155.4MB in the end (delta: -14.4MB). Peak memory consumption was 188.6MB. Max. memory is 16.1GB. * Witness Printer took 93.31ms. Allocated memory is still 383.8MB. Free memory was 155.4MB in the beginning and 150.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[4]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#res!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 629]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 2307 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2085 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3249 IncrementalHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 222 mSDtfsCounter, 3249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 341 SyntacticMatches, 3 SemanticMatches, 285 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2051 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 651 NumberOfCodeBlocks, 651 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 693 ConstructedInterpolants, 40 QuantifiedInterpolants, 8305 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 531 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 283/444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((count == 1) && (data == 1)) && (len == 2)) || (((count == 3) && (data == 1)) && (len == 2))) || (((data == 1) && (len == 2)) && (2 == count))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((2 == len) && (data == 1)) && (len == 2)) && (data == 1)) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) || ((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-19 20:52:20,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE