./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:11,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:11,689 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:10:11,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:11,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:11,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:11,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:11,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:11,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:11,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:11,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:11,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:11,751 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:11,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:11,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:10:11,753 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:10:11,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:10:11,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:10:11,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:11,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:10:11,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:11,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:10:11,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:10:11,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:10:11,758 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:11,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:11,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:11,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:11,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:11,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:11,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:11,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:10:11,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:10:11,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:10:11,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:11,765 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:10:11,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:11,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:11,766 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:11,767 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2023-11-06 22:10:12,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:12,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:12,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:12,069 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:12,069 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:12,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-11-06 22:10:15,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:15,671 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:15,672 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-11-06 22:10:15,699 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/data/36ff36328/bef47c8152ff4b06a958afdf2b9e3a24/FLAG6f46dfd0c [2023-11-06 22:10:15,721 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/data/36ff36328/bef47c8152ff4b06a958afdf2b9e3a24 [2023-11-06 22:10:15,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:15,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:15,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:15,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:15,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:15,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:15" (1/1) ... [2023-11-06 22:10:15,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5992baaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:15, skipping insertion in model container [2023-11-06 22:10:15,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:15" (1/1) ... [2023-11-06 22:10:15,827 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:16,181 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2023-11-06 22:10:16,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:16,197 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:16,280 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2023-11-06 22:10:16,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:16,312 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:16,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16 WrapperNode [2023-11-06 22:10:16,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:16,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:16,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:16,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:16,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,367 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-11-06 22:10:16,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:16,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:16,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:16,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:16,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:16,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:16,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:16,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:16,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (1/1) ... [2023-11-06 22:10:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:16,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:10:16,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:10:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:10:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:10:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:10:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:10:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:10:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:10:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:10:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:16,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:16,617 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:16,618 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:16,824 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:16,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:16,831 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 22:10:16,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:16 BoogieIcfgContainer [2023-11-06 22:10:16,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:16,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:16,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:16,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:16,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:15" (1/3) ... [2023-11-06 22:10:16,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47289ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:16, skipping insertion in model container [2023-11-06 22:10:16,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:16" (2/3) ... [2023-11-06 22:10:16,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47289ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:16, skipping insertion in model container [2023-11-06 22:10:16,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:16" (3/3) ... [2023-11-06 22:10:16,844 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2023-11-06 22:10:16,863 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:16,863 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:10:16,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:16,916 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2df87f60, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:16,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:10:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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) [2023-11-06 22:10:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:10:16,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:16,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:16,928 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:16,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1517700322, now seen corresponding path program 1 times [2023-11-06 22:10:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454434986] [2023-11-06 22:10:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:17,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:17,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454434986] [2023-11-06 22:10:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454434986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:17,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:17,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173704960] [2023-11-06 22:10:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:17,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:17,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:17,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:17,279 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-06 22:10:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:17,344 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2023-11-06 22:10:17,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2023-11-06 22:10:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:17,354 INFO L225 Difference]: With dead ends: 58 [2023-11-06 22:10:17,354 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 22:10:17,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:17,361 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:17,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 22:10:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-11-06 22:10:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2023-11-06 22:10:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-06 22:10:17,396 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2023-11-06 22:10:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:17,397 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-06 22:10:17,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-06 22:10:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-06 22:10:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:10:17,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:17,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:17,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:10:17,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:17,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1110902602, now seen corresponding path program 1 times [2023-11-06 22:10:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:17,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291671589] [2023-11-06 22:10:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:17,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291671589] [2023-11-06 22:10:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291671589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842352212] [2023-11-06 22:10:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:17,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:17,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:17,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:17,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:10:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:17,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:17,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:17,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842352212] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:17,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 22:10:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909998972] [2023-11-06 22:10:17,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:17,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:18,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:18,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:18,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:18,001 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-11-06 22:10:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:18,032 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-11-06 22:10:18,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:18,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 18 [2023-11-06 22:10:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:18,033 INFO L225 Difference]: With dead ends: 45 [2023-11-06 22:10:18,034 INFO L226 Difference]: Without dead ends: 29 [2023-11-06 22:10:18,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:18,036 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:18,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-06 22:10:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-06 22:10:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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) [2023-11-06 22:10:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-11-06 22:10:18,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2023-11-06 22:10:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:18,045 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-11-06 22:10:18,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-11-06 22:10:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-11-06 22:10:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:10:18,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:18,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:18,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:10:18,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:18,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:18,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 266893854, now seen corresponding path program 2 times [2023-11-06 22:10:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:18,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173886843] [2023-11-06 22:10:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173886843] [2023-11-06 22:10:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173886843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:18,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:18,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999889919] [2023-11-06 22:10:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:18,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:18,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:18,554 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-11-06 22:10:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:18,604 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-11-06 22:10:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 23 [2023-11-06 22:10:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:18,611 INFO L225 Difference]: With dead ends: 51 [2023-11-06 22:10:18,613 INFO L226 Difference]: Without dead ends: 42 [2023-11-06 22:10:18,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:18,616 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:18,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-06 22:10:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2023-11-06 22:10:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2023-11-06 22:10:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-06 22:10:18,634 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2023-11-06 22:10:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:18,635 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-06 22:10:18,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-11-06 22:10:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-06 22:10:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:10:18,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:18,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:18,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:10:18,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:18,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1444962716, now seen corresponding path program 1 times [2023-11-06 22:10:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533139871] [2023-11-06 22:10:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533139871] [2023-11-06 22:10:18,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533139871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:18,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053885172] [2023-11-06 22:10:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:18,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:18,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:18,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:18,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:10:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:19,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:10:19,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:19,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053885172] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:19,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:19,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-06 22:10:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129097233] [2023-11-06 22:10:19,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:19,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:10:19,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:19,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:10:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:19,305 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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) [2023-11-06 22:10:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:19,375 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2023-11-06 22:10:19,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:19,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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) Word has length 28 [2023-11-06 22:10:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:19,378 INFO L225 Difference]: With dead ends: 53 [2023-11-06 22:10:19,379 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 22:10:19,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:19,382 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:19,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 22:10:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-11-06 22:10:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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) [2023-11-06 22:10:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-06 22:10:19,404 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 28 [2023-11-06 22:10:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:19,405 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-06 22:10:19,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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) [2023-11-06 22:10:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-06 22:10:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:10:19,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:19,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:19,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:19,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:19,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:19,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1623423198, now seen corresponding path program 2 times [2023-11-06 22:10:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:19,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207324667] [2023-11-06 22:10:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207324667] [2023-11-06 22:10:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207324667] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699158613] [2023-11-06 22:10:19,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:19,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:19,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:10:19,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:10:19,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:19,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:19,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:19,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699158613] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:19,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:19,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-06 22:10:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838729778] [2023-11-06 22:10:19,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:19,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:10:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:19,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:10:19,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:19,992 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) [2023-11-06 22:10:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:20,069 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-11-06 22:10:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:20,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) Word has length 33 [2023-11-06 22:10:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:20,073 INFO L225 Difference]: With dead ends: 58 [2023-11-06 22:10:20,074 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 22:10:20,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:20,079 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:20,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 112 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:10:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 22:10:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2023-11-06 22:10:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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) [2023-11-06 22:10:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-06 22:10:20,096 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2023-11-06 22:10:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:20,099 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-06 22:10:20,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) [2023-11-06 22:10:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-06 22:10:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:10:20,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:20,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:20,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:20,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:20,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:20,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1284207405, now seen corresponding path program 1 times [2023-11-06 22:10:20,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246674126] [2023-11-06 22:10:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246674126] [2023-11-06 22:10:21,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246674126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730975568] [2023-11-06 22:10:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:21,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:21,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:21,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:10:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:21,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-06 22:10:21,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:22,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:10:22,149 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:10:22,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:10:22,237 INFO L351 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 19 treesize of output 1 [2023-11-06 22:10:22,479 INFO L351 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 26 treesize of output 14 [2023-11-06 22:10:22,487 INFO L351 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 [2023-11-06 22:10:22,644 INFO L351 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 20 treesize of output 8 [2023-11-06 22:10:22,715 INFO L351 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 [2023-11-06 22:10:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:22,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:23,171 INFO L351 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 42 treesize of output 38 [2023-11-06 22:10:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730975568] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:23,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:23,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 49 [2023-11-06 22:10:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691723251] [2023-11-06 22:10:23,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:23,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 22:10:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 22:10:23,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2187, Unknown=0, NotChecked=0, Total=2352 [2023-11-06 22:10:23,776 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 49 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 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) [2023-11-06 22:10:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:25,569 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2023-11-06 22:10:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:10:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 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) Word has length 34 [2023-11-06 22:10:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:25,576 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:10:25,576 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:10:25,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=610, Invalid=4792, Unknown=0, NotChecked=0, Total=5402 [2023-11-06 22:10:25,580 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 370 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:25,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 389 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:10:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:10:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2023-11-06 22:10:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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) [2023-11-06 22:10:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2023-11-06 22:10:25,604 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 34 [2023-11-06 22:10:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:25,604 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2023-11-06 22:10:25,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 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) [2023-11-06 22:10:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2023-11-06 22:10:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:10:25,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:25,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:25,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 22:10:25,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:25,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:25,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1207377995, now seen corresponding path program 1 times [2023-11-06 22:10:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:25,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837876604] [2023-11-06 22:10:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:10:25,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837876604] [2023-11-06 22:10:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837876604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:25,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028483799] [2023-11-06 22:10:25,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:25,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:25,924 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-11-06 22:10:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:25,965 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2023-11-06 22:10:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 35 [2023-11-06 22:10:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:25,969 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:10:25,969 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 22:10:25,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:25,971 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:25,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 61 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 22:10:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-11-06 22:10:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 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) [2023-11-06 22:10:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-11-06 22:10:25,995 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 35 [2023-11-06 22:10:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:25,996 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-11-06 22:10:25,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-11-06 22:10:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-11-06 22:10:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:10:25,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:25,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:25,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:10:25,998 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:25,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash -641547586, now seen corresponding path program 2 times [2023-11-06 22:10:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:25,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795753737] [2023-11-06 22:10:25,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:25,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795753737] [2023-11-06 22:10:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795753737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975262746] [2023-11-06 22:10:26,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:26,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:26,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:26,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:26,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:10:26,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:10:26,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:26,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:10:26,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:26,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:10:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975262746] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:26,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-11-06 22:10:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600726013] [2023-11-06 22:10:26,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:26,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:10:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:10:26,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:10:26,388 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) [2023-11-06 22:10:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:26,451 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2023-11-06 22:10:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) Word has length 35 [2023-11-06 22:10:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:26,452 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:10:26,452 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:10:26,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:26,455 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:26,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 81 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:10:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2023-11-06 22:10:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 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) [2023-11-06 22:10:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2023-11-06 22:10:26,473 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 35 [2023-11-06 22:10:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:26,474 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2023-11-06 22:10:26,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) [2023-11-06 22:10:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2023-11-06 22:10:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:10:26,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:26,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:26,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:26,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:26,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:26,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2028742216, now seen corresponding path program 1 times [2023-11-06 22:10:26,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:26,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199656731] [2023-11-06 22:10:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:10:26,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199656731] [2023-11-06 22:10:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199656731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:26,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882244684] [2023-11-06 22:10:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:26,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:26,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:26,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:10:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:26,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:26,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:10:27,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:10:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882244684] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:27,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-06 22:10:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659698605] [2023-11-06 22:10:27,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:27,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:27,035 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-11-06 22:10:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:27,085 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2023-11-06 22:10:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:27,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) Word has length 40 [2023-11-06 22:10:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:27,088 INFO L225 Difference]: With dead ends: 67 [2023-11-06 22:10:27,088 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 22:10:27,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:27,091 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:27,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 22:10:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2023-11-06 22:10:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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) [2023-11-06 22:10:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-11-06 22:10:27,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 40 [2023-11-06 22:10:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:27,110 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-11-06 22:10:27,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-11-06 22:10:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-11-06 22:10:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:10:27,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:27,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:27,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:27,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:27,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:27,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1585154848, now seen corresponding path program 1 times [2023-11-06 22:10:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:27,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357087828] [2023-11-06 22:10:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357087828] [2023-11-06 22:10:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357087828] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785582182] [2023-11-06 22:10:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:29,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:29,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:29,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:29,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:10:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:29,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-06 22:10:29,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:29,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:10:29,600 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:10:29,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:10:29,692 INFO L351 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 [2023-11-06 22:10:29,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:29,946 INFO L351 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 24 treesize of output 12 [2023-11-06 22:10:29,955 INFO L351 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 8 treesize of output 1 [2023-11-06 22:10:30,219 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:10:30,219 INFO L351 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-11-06 22:10:30,227 INFO L351 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 23 treesize of output 15 [2023-11-06 22:10:30,232 INFO L351 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 32 treesize of output 19 [2023-11-06 22:10:30,623 INFO L351 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 31 treesize of output 19 [2023-11-06 22:10:30,627 INFO L351 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 19 treesize of output 11 [2023-11-06 22:10:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:30,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:30,968 INFO L351 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 86 treesize of output 64 [2023-11-06 22:10:31,166 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_697 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_697) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (forall ((v_ArrVal_698 (Array Int Int))) (= .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_698) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))) is different from false [2023-11-06 22:10:31,318 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_698 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_697 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2023-11-06 22:10:31,342 INFO L351 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 215 treesize of output 191 [2023-11-06 22:10:31,351 INFO L351 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 93 treesize of output 85 [2023-11-06 22:10:31,357 INFO L351 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 85 treesize of output 81 [2023-11-06 22:10:31,394 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_693 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_693 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_693)))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2023-11-06 22:10:31,782 INFO L351 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 18 treesize of output 16 [2023-11-06 22:10:31,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-06 22:10:32,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785582182] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:32,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:32,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 58 [2023-11-06 22:10:32,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633155035] [2023-11-06 22:10:32,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:32,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-06 22:10:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-06 22:10:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2746, Unknown=38, NotChecked=324, Total=3306 [2023-11-06 22:10:32,020 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 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) [2023-11-06 22:10:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:34,113 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2023-11-06 22:10:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:10:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 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) Word has length 41 [2023-11-06 22:10:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:34,115 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:10:34,115 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:10:34,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=588, Invalid=5547, Unknown=39, NotChecked=468, Total=6642 [2023-11-06 22:10:34,120 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 286 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:34,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 455 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 975 Invalid, 0 Unknown, 247 Unchecked, 0.8s Time] [2023-11-06 22:10:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:10:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 67. [2023-11-06 22:10:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 states have internal predecessors, (75), 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) [2023-11-06 22:10:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2023-11-06 22:10:34,143 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 41 [2023-11-06 22:10:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:34,143 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2023-11-06 22:10:34,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 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) [2023-11-06 22:10:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2023-11-06 22:10:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:10:34,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:34,145 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:34,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:34,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:10:34,351 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:34,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1350763507, now seen corresponding path program 3 times [2023-11-06 22:10:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304528571] [2023-11-06 22:10:34,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:34,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:10:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:34,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304528571] [2023-11-06 22:10:34,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304528571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:34,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550131187] [2023-11-06 22:10:34,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:10:34,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:34,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:34,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:34,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:10:34,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 22:10:34,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:34,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:34,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:10:34,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:34,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550131187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:34,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:10:34,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-06 22:10:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312746044] [2023-11-06 22:10:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:34,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:34,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:34,940 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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) [2023-11-06 22:10:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:34,982 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-11-06 22:10:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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) Word has length 41 [2023-11-06 22:10:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:34,984 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:10:34,984 INFO L226 Difference]: Without dead ends: 43 [2023-11-06 22:10:34,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:34,986 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:34,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-06 22:10:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-06 22:10:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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) [2023-11-06 22:10:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2023-11-06 22:10:34,999 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2023-11-06 22:10:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:35,001 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2023-11-06 22:10:35,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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) [2023-11-06 22:10:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2023-11-06 22:10:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:10:35,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:35,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:35,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:35,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:10:35,209 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:35,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1946814136, now seen corresponding path program 2 times [2023-11-06 22:10:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377650046] [2023-11-06 22:10:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:10:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:35,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377650046] [2023-11-06 22:10:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377650046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:35,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439145941] [2023-11-06 22:10:35,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:35,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:35,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:35,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:35,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:10:35,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:10:35,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:35,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:10:35,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:10:35,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:10:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439145941] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:35,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-06 22:10:35,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350569583] [2023-11-06 22:10:35,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:35,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:10:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:10:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:35,652 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) [2023-11-06 22:10:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:35,713 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2023-11-06 22:10:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:35,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) Word has length 42 [2023-11-06 22:10:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:35,714 INFO L225 Difference]: With dead ends: 43 [2023-11-06 22:10:35,714 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:10:35,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:10:35,716 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:35,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:10:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:10:35,717 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) [2023-11-06 22:10:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:10:35,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2023-11-06 22:10:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:35,718 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:10:35,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) [2023-11-06 22:10:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:10:35,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:10:35,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:10:35,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:35,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:35,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:10:36,598 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-11-06 22:10:36,599 INFO L895 garLoopResultBuilder]: At program point sll_get_data_at_returnLabel#1(lines 599 605) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse6))) (.cse1 (= (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_sll_get_data_at_#res#1|) (= 3 |ULTIMATE.start_main_~expected~0#1|) .cse1 (= .cse2 3) .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= 2 |ULTIMATE.start_sll_get_data_at_#res#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2) .cse1 (= .cse2 2) .cse3 .cse4 .cse5 (= |ULTIMATE.start_sll_get_data_at_~index#1| 0))))) [2023-11-06 22:10:36,599 INFO L899 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2023-11-06 22:10:36,599 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse2 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse5))) (.cse3 (= (select (select |#memory_int| .cse5) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse2 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2) .cse3 .cse0 .cse1 .cse4) (and .cse2 (= |ULTIMATE.start_main_~i~0#1| 1) .cse3 .cse0 .cse1 .cse4)))) [2023-11-06 22:10:36,599 INFO L899 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2023-11-06 22:10:36,600 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 613 632) the Hoare annotation is: true [2023-11-06 22:10:36,600 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 612) no Hoare annotation was computed. [2023-11-06 22:10:36,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:10:36,600 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_sll_update_at_~data#1|)) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) (.cse3 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2)) (.cse4 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|))) (.cse9 (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (not .cse0) .cse1 .cse2 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse3 .cse4 (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse4 .cse5 (= 2 |ULTIMATE.start_sll_update_at_~data#1|) .cse9 .cse6 (= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse0 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse10)) .cse7 .cse8) (and (= |ULTIMATE.start_sll_update_at_~index#1| 1) .cse1 .cse2 (not (= .cse10 |ULTIMATE.start_main_~s~0#1.base|)) .cse3 .cse4 .cse5 .cse9 .cse6 .cse0 .cse7 .cse8))) [2023-11-06 22:10:36,600 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2023-11-06 22:10:36,600 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2023-11-06 22:10:36,601 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:10:36,601 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse9))) (.cse7 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse8 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse1 (= (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2) .cse1 (= .cse2 2) .cse3 .cse4 .cse5 (= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) 4))) (and .cse0 (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| .cse6)) .cse7 (= (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) 4)) 3) .cse8 .cse1 .cse3 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_get_data_at_~index#1| 1) .cse4 .cse5)) (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) .cse0 .cse7 .cse8 .cse1 (= .cse2 3) .cse3 .cse4 .cse5)))) [2023-11-06 22:10:36,601 INFO L899 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2023-11-06 22:10:36,601 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-11-06 22:10:36,601 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-06 22:10:36,602 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-11-06 22:10:36,602 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-11-06 22:10:36,602 INFO L899 garLoopResultBuilder]: For program point L618-2(lines 618 621) no Hoare annotation was computed. [2023-11-06 22:10:36,602 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2023-11-06 22:10:36,602 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|))) (.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse7))) (.cse6 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse6 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 (= (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse5)))) [2023-11-06 22:10:36,603 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))) (or (and .cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse1) (and .cse0 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse1 .cse2))) [2023-11-06 22:10:36,603 INFO L899 garLoopResultBuilder]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2023-11-06 22:10:36,603 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-11-06 22:10:36,603 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:10:36,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-11-06 22:10:36,604 INFO L895 garLoopResultBuilder]: At program point node_create_returnLabel#1(lines 574 582) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse1 (<= 1 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse2 .cse3))) [2023-11-06 22:10:36,604 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:10:36,604 INFO L895 garLoopResultBuilder]: At program point sll_create_returnLabel#1(lines 583 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) [2023-11-06 22:10:36,604 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 613 632) the Hoare annotation is: false [2023-11-06 22:10:36,607 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1] [2023-11-06 22:10:36,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:10:36,624 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,625 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,625 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,625 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,626 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,626 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,626 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,627 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,627 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,627 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,628 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,629 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,629 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,629 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,633 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,633 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,633 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,633 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,635 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,635 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,636 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,636 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,636 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,638 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,638 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,638 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,639 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,639 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 22:10:36,640 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,640 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 22:10:36,642 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,642 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,643 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,643 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,643 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,643 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,644 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,644 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,644 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,644 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,644 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,647 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,648 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,648 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,648 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,648 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,650 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,650 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,650 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,650 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,651 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,651 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,651 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,651 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,653 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,653 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,654 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,654 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,654 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,654 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,655 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,655 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,655 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,655 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,656 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 22:10:36,656 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 22:10:36,656 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,656 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,657 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,657 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,657 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,657 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,658 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,659 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,659 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,660 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,660 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,660 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,660 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,661 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,661 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,661 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,661 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,662 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 22:10:36,662 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 22:10:36,662 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,662 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,663 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,663 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,663 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,663 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,664 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,665 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,666 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,667 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,667 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,667 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,667 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,668 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 22:10:36,668 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,668 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,669 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,669 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,669 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 22:10:36,671 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,671 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 22:10:36,671 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 22:10:36,672 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,672 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,672 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,672 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,673 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,673 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,673 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,673 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,674 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,674 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,674 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,675 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,675 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,675 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,675 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,676 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,676 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,676 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,676 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,676 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,677 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,678 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,678 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 22:10:36,679 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 22:10:36,679 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,679 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,680 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,680 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,680 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,680 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,680 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,681 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,681 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,681 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,681 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,682 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,682 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,682 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,683 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,683 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,683 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,683 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,684 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,684 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,684 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:10:36 BoogieIcfgContainer [2023-11-06 22:10:36,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:10:36,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:10:36,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:10:36,686 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:10:36,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:16" (3/4) ... [2023-11-06 22:10:36,689 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:10:36,698 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-06 22:10:36,699 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-06 22:10:36,699 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:10:36,700 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:10:36,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\valid(head) == 1) && (len == 2)) && (\valid(\result) == 1)) || ((2 == len) && (len == 2))) || ((((\valid(head) == 1) && (1 <= len)) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\valid(head) == 1) && (len == 2)) && (\valid(\result) == 1)) [2023-11-06 22:10:36,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((i == 0) && (len == 2)) && (\valid(\result) == 1)) || (((i == 1) && (len == 2)) && (\valid(\result) == 1))) || (((2 <= i) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 == len) && (\valid(temp) == 1)) && (len == 2)) && (\valid(\result) == 1)) || ((((((!((temp == head)) && (\valid(temp) == 1)) && (\valid(head) == 1)) && (1 <= len)) && !((\result == head))) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= i) && (len == 2)) && (\valid(\result) == 1)) || (((i == 0) && (len == 2)) && (\valid(\result) == 1))) || (((i == 1) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!((head == s)) && (3 == data)) && (i == 1)) && (index <= 0)) && (len == 2)) && (\valid(\result) == 1)) || ((((((i == 0) && (2 == data)) && (len == 2)) && (index == 0)) && (head == s)) && (\valid(\result) == 1))) || ((((((index == 1) && (3 == data)) && (i == 1)) && (len == 2)) && (head == s)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((i == 0) && (2 == expected)) && (*head == 2)) && (len == 2)) && (\valid(\result) == 1)) && (index == 0)) || (((((i == 1) && (3 == expected)) && (len == 2)) && (index == 1)) && (\valid(\result) == 1))) || ((((((index <= 0) && (i == 1)) && (3 == expected)) && (*head == 3)) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((i == 1) && (3 == \result)) && (3 == expected)) && (*head == 3)) && (len == 2)) && (\valid(\result) == 1)) || (((((((i == 0) && (2 == \result)) && (2 == expected)) && (*head == 2)) && (len == 2)) && (\valid(\result) == 1)) && (index == 0))) [2023-11-06 22:10:36,749 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\valid(head) == 1) && (len == 2)) && (\valid(\result) == 1)) || ((2 == len) && (len == 2))) || ((((\valid(head) == 1) && (1 <= len)) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,749 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\valid(head) == 1) && (len == 2)) && (\valid(\result) == 1)) [2023-11-06 22:10:36,750 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((i == 0) && (len == 2)) && (\valid(\result) == 1)) || (((i == 1) && (len == 2)) && (\valid(\result) == 1))) || (((2 <= i) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,750 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 == len) && (\valid(temp) == 1)) && (len == 2)) && (\valid(\result) == 1)) || ((((((!((temp == head)) && (\valid(temp) == 1)) && (\valid(head) == 1)) && (1 <= len)) && !((\result == head))) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,750 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= i) && (len == 2)) && (\valid(\result) == 1)) || (((i == 0) && (len == 2)) && (\valid(\result) == 1))) || (((i == 1) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,750 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!((head == s)) && (3 == data)) && (i == 1)) && (index <= 0)) && (len == 2)) && (\valid(\result) == 1)) || ((((((i == 0) && (2 == data)) && (len == 2)) && (index == 0)) && (head == s)) && (\valid(\result) == 1))) || ((((((index == 1) && (3 == data)) && (i == 1)) && (len == 2)) && (head == s)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,751 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((i == 0) && (2 == expected)) && (*head == 2)) && (len == 2)) && (\valid(\result) == 1)) && (index == 0)) || (((((i == 1) && (3 == expected)) && (len == 2)) && (index == 1)) && (\valid(\result) == 1))) || ((((((index <= 0) && (i == 1)) && (3 == expected)) && (*head == 3)) && (len == 2)) && (\valid(\result) == 1))) [2023-11-06 22:10:36,751 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((i == 1) && (3 == \result)) && (3 == expected)) && (*head == 3)) && (len == 2)) && (\valid(\result) == 1)) || (((((((i == 0) && (2 == \result)) && (2 == expected)) && (*head == 2)) && (len == 2)) && (\valid(\result) == 1)) && (index == 0))) [2023-11-06 22:10:36,765 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:10:36,765 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:10:36,766 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:10:36,766 INFO L158 Benchmark]: Toolchain (without parser) took 21029.84ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 127.0MB in the beginning and 207.2MB in the end (delta: -80.3MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2023-11-06 22:10:36,767 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 167.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:10:36,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.87ms. Allocated memory is still 167.8MB. Free memory was 127.0MB in the beginning and 109.6MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:10:36,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.87ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:36,768 INFO L158 Benchmark]: Boogie Preprocessor took 38.35ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 106.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:10:36,768 INFO L158 Benchmark]: RCFGBuilder took 426.07ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 91.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:10:36,769 INFO L158 Benchmark]: TraceAbstraction took 19848.88ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 90.3MB in the beginning and 211.4MB in the end (delta: -121.1MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2023-11-06 22:10:36,769 INFO L158 Benchmark]: Witness Printer took 80.20ms. Allocated memory is still 325.1MB. Free memory was 211.4MB in the beginning and 207.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:10:36,771 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.36ms. Allocated memory is still 167.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.87ms. Allocated memory is still 167.8MB. Free memory was 127.0MB in the beginning and 109.6MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.87ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.35ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 106.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 426.07ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 91.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19848.88ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 90.3MB in the beginning and 211.4MB in the end (delta: -121.1MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. * Witness Printer took 80.20ms. Allocated memory is still 325.1MB. Free memory was 211.4MB in the beginning and 207.2MB in the end (delta: 4.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: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression * 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: 630]: 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 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 921 mSDsluCounter, 1587 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 247 IncrementalHoareTripleChecker+Unchecked, 1296 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2035 IncrementalHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 291 mSDtfsCounter, 2035 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 722 GetRequests, 500 SyntacticMatches, 17 SemanticMatches, 205 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=10, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 118 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 33 NumberOfFragments, 814 HoareAnnotationTreeSize, 12 FomulaSimplifications, 9330 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 157 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 695 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 937 ConstructedInterpolants, 15 QuantifiedInterpolants, 4664 SizeOfPredicates, 93 NumberOfNonLiveVariables, 2442 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 339/482 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: 599]: Loop Invariant [2023-11-06 22:10:36,798 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,799 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,799 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,799 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,800 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,800 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,800 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,800 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,800 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,801 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,802 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,802 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,802 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,802 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,804 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated Derived loop invariant: (((((((i == 1) && (3 == \result)) && (3 == expected)) && (*head == 3)) && (len == 2)) && (\valid(\result) == 1)) || (((((((i == 0) && (2 == \result)) && (2 == expected)) && (*head == 2)) && (len == 2)) && (\valid(\result) == 1)) && (index == 0))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2023-11-06 22:10:36,805 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,805 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,805 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,806 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,806 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,806 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,806 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,806 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,807 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,807 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,808 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,808 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,808 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,808 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,808 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,809 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,809 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,809 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,809 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,810 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated Derived loop invariant: (((((2 <= i) && (len == 2)) && (\valid(\result) == 1)) || (((i == 0) && (len == 2)) && (\valid(\result) == 1))) || (((i == 1) && (len == 2)) && (\valid(\result) == 1))) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2023-11-06 22:10:36,810 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,811 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 22:10:36,811 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,811 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated Derived loop invariant: (((((\valid(head) == 1) && (len == 2)) && (\valid(\result) == 1)) || ((2 == len) && (len == 2))) || ((((\valid(head) == 1) && (1 <= len)) && (len == 2)) && (\valid(\result) == 1))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2023-11-06 22:10:36,813 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,813 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,813 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,813 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,815 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,815 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,815 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,815 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,817 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,817 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,818 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,818 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,818 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,818 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,819 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,819 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,819 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,819 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,819 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated Derived loop invariant: (((((i == 0) && (len == 2)) && (\valid(\result) == 1)) || (((i == 1) && (len == 2)) && (\valid(\result) == 1))) || (((2 <= i) && (len == 2)) && (\valid(\result) == 1))) - InvariantResult [Line: 600]: Loop Invariant [2023-11-06 22:10:36,822 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,822 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,822 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,823 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,823 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,823 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,823 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,824 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,824 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,824 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,824 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 22:10:36,824 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 22:10:36,825 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,825 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,825 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,825 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,825 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,826 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,826 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,827 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,832 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,833 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,833 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,833 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,833 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,834 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,834 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,834 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,834 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]] could not be translated [2023-11-06 22:10:36,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-06 22:10:36,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]] could not be translated [2023-11-06 22:10:36,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated Derived loop invariant: ((((((((i == 0) && (2 == expected)) && (*head == 2)) && (len == 2)) && (\valid(\result) == 1)) && (index == 0)) || (((((i == 1) && (3 == expected)) && (len == 2)) && (index == 1)) && (\valid(\result) == 1))) || ((((((index <= 0) && (i == 1)) && (3 == expected)) && (*head == 3)) && (len == 2)) && (\valid(\result) == 1))) - InvariantResult [Line: 574]: Loop Invariant [2023-11-06 22:10:36,837 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: (((((2 == len) && (\valid(temp) == 1)) && (len == 2)) && (\valid(\result) == 1)) || ((((((!((temp == head)) && (\valid(temp) == 1)) && (\valid(head) == 1)) && (1 <= len)) && !((\result == head))) && (len == 2)) && (\valid(\result) == 1))) - InvariantResult [Line: 583]: Loop Invariant [2023-11-06 22:10:36,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-06 22:10:36,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base] could not be translated [2023-11-06 22:10:36,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated Derived loop invariant: (((\valid(head) == 1) && (len == 2)) && (\valid(\result) == 1)) - InvariantResult [Line: 607]: Loop Invariant [2023-11-06 22:10:36,842 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,843 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 22:10:36,843 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 22:10:36,843 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,843 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base] could not be translated [2023-11-06 22:10:36,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-06 22:10:36,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base] could not be translated [2023-11-06 22:10:36,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-06 22:10:36,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base] could not be translated [2023-11-06 22:10:36,854 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-06 22:10:36,855 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base] could not be translated [2023-11-06 22:10:36,855 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-06 22:10:36,855 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:10:36,855 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base] could not be translated [2023-11-06 22:10:36,855 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][4] could not be translated [2023-11-06 22:10:36,856 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: (((((((!((head == s)) && (3 == data)) && (i == 1)) && (index <= 0)) && (len == 2)) && (\valid(\result) == 1)) || ((((((i == 0) && (2 == data)) && (len == 2)) && (index == 0)) && (head == s)) && (\valid(\result) == 1))) || ((((((index == 1) && (3 == data)) && (i == 1)) && (len == 2)) && (head == s)) && (\valid(\result) == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:10:36,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6ad3665-737f-4d34-a2b8-19eb3b873fc1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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