./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:59:39,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:59:39,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 02:59:39,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:59:39,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:59:39,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:59:39,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:59:39,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:59:39,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:59:39,100 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:59:39,100 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:59:39,101 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:59:39,101 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:59:39,101 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:59:39,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 02:59:39,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 02:59:39,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:59:39,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:59:39,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:59:39,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:59:39,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 02:59:39,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:59:39,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:59:39,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:59:39,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:59:39,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:59:39,106 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 [2024-11-14 02:59:39,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:59:39,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:59:39,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:59:39,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:59:39,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:59:39,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2n_update_all.i Unable to find full path for "g++" [2024-11-14 02:59:41,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:59:41,748 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:59:41,751 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-11-14 02:59:41,767 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/data/16f34a421/2130925582114abbb6c1bf36d467a983/FLAG4c2015615 [2024-11-14 02:59:41,789 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/data/16f34a421/2130925582114abbb6c1bf36d467a983 [2024-11-14 02:59:41,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:59:41,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:59:41,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:59:41,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:59:41,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:59:41,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:59:41" (1/1) ... [2024-11-14 02:59:41,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1a12f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:41, skipping insertion in model container [2024-11-14 02:59:41,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:59:41" (1/1) ... [2024-11-14 02:59:41,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:59:42,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:59:42,261 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:59:42,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:59:42,351 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:59:42,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42 WrapperNode [2024-11-14 02:59:42,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:59:42,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:59:42,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:59:42,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:59:42,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,392 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2024-11-14 02:59:42,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:59:42,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:59:42,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:59:42,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:59:42,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:59:42,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:59:42,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:59:42,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:59:42,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (1/1) ... [2024-11-14 02:59:42,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:59:42,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:59:42,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:59:42,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:59:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:59:42,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:59:42,648 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:59:42,650 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:59:43,006 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-14 02:59:43,008 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:59:43,081 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:59:43,083 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-14 02:59:43,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:59:43 BoogieIcfgContainer [2024-11-14 02:59:43,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:59:43,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:59:43,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:59:43,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:59:43,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:59:41" (1/3) ... [2024-11-14 02:59:43,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23612ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:59:43, skipping insertion in model container [2024-11-14 02:59:43,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:59:42" (2/3) ... [2024-11-14 02:59:43,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23612ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:59:43, skipping insertion in model container [2024-11-14 02:59:43,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:59:43" (3/3) ... [2024-11-14 02:59:43,096 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2024-11-14 02:59:43,114 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:59:43,116 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all.i that has 1 procedures, 47 locations, 1 initial locations, 6 loop locations, and 21 error locations. [2024-11-14 02:59:43,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:59:43,182 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7da0abd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:59:43,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-14 02:59:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 2.2) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 02:59:43,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:43,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 02:59:43,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 5372505, now seen corresponding path program 1 times [2024-11-14 02:59:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835719363] [2024-11-14 02:59:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:43,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835719363] [2024-11-14 02:59:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835719363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:43,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:43,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:59:43,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222232935] [2024-11-14 02:59:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:43,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:59:43,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:43,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:59:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:59:43,531 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 2.2) internal successors, (55), 46 states have internal predecessors, (55), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:43,651 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-14 02:59:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:59:43,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-14 02:59:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:43,660 INFO L225 Difference]: With dead ends: 44 [2024-11-14 02:59:43,660 INFO L226 Difference]: Without dead ends: 42 [2024-11-14 02:59:43,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:59:43,667 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:43,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-14 02:59:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-14 02:59:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-14 02:59:43,709 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 4 [2024-11-14 02:59:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:43,712 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-14 02:59:43,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-14 02:59:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 02:59:43,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:43,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 02:59:43,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:59:43,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:43,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash 5372506, now seen corresponding path program 1 times [2024-11-14 02:59:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154211480] [2024-11-14 02:59:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:43,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154211480] [2024-11-14 02:59:43,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154211480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:43,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:43,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:59:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746819690] [2024-11-14 02:59:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:43,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:59:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:59:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:59:43,898 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:44,007 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-14 02:59:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:59:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-14 02:59:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:44,009 INFO L225 Difference]: With dead ends: 40 [2024-11-14 02:59:44,009 INFO L226 Difference]: Without dead ends: 40 [2024-11-14 02:59:44,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:59:44,011 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:44,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-14 02:59:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-14 02:59:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 39 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) [2024-11-14 02:59:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-14 02:59:44,017 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 4 [2024-11-14 02:59:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:44,019 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-14 02:59:44,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-14 02:59:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 02:59:44,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:44,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 02:59:44,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 02:59:44,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:44,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash 171256275, now seen corresponding path program 1 times [2024-11-14 02:59:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:44,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056140360] [2024-11-14 02:59:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:44,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056140360] [2024-11-14 02:59:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056140360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:44,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:59:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586956219] [2024-11-14 02:59:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:59:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:59:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:59:44,117 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:44,185 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-14 02:59:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:59:44,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-14 02:59:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:44,187 INFO L225 Difference]: With dead ends: 47 [2024-11-14 02:59:44,189 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 02:59:44,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:59:44,190 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:44,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 02:59:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2024-11-14 02:59:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-14 02:59:44,200 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 5 [2024-11-14 02:59:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:44,200 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-14 02:59:44,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-14 02:59:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 02:59:44,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:44,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 02:59:44,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 02:59:44,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:44,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash 868013943, now seen corresponding path program 1 times [2024-11-14 02:59:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:44,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327062456] [2024-11-14 02:59:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:44,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327062456] [2024-11-14 02:59:44,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327062456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:44,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:44,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:59:44,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873012606] [2024-11-14 02:59:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:44,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:59:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:44,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:59:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:59:44,342 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:44,457 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-14 02:59:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:59:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-14 02:59:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:44,459 INFO L225 Difference]: With dead ends: 40 [2024-11-14 02:59:44,459 INFO L226 Difference]: Without dead ends: 40 [2024-11-14 02:59:44,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:59:44,460 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:44,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-14 02:59:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-14 02:59:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.875) internal successors, (45), 39 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) [2024-11-14 02:59:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-14 02:59:44,467 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2024-11-14 02:59:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:44,467 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-14 02:59:44,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-14 02:59:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 02:59:44,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:44,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 02:59:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 02:59:44,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 868013944, now seen corresponding path program 1 times [2024-11-14 02:59:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007813323] [2024-11-14 02:59:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:44,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007813323] [2024-11-14 02:59:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007813323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:59:44,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440343626] [2024-11-14 02:59:44,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:44,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:59:44,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:44,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:59:44,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:59:44,685 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:44,770 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-14 02:59:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:59:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-14 02:59:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:44,774 INFO L225 Difference]: With dead ends: 39 [2024-11-14 02:59:44,774 INFO L226 Difference]: Without dead ends: 39 [2024-11-14 02:59:44,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:59:44,775 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:44,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-14 02:59:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-14 02:59:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 38 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) [2024-11-14 02:59:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-14 02:59:44,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2024-11-14 02:59:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:44,785 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-14 02:59:44,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-14 02:59:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 02:59:44,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:44,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:44,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 02:59:44,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:44,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:44,788 INFO L85 PathProgramCache]: Analyzing trace with hash -649955180, now seen corresponding path program 1 times [2024-11-14 02:59:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:44,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521268364] [2024-11-14 02:59:44,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:44,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:44,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521268364] [2024-11-14 02:59:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521268364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:59:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519839327] [2024-11-14 02:59:44,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:59:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:59:44,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:59:44,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:59:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:45,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 02:59:45,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:59:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:45,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:59:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519839327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:59:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [971573552] [2024-11-14 02:59:45,198 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2024-11-14 02:59:45,199 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:59:45,204 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:59:45,209 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:59:45,210 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:59:46,590 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:59:47,299 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '538#(and (not (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_sll_update_at_~data#1|) (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-14 02:59:47,300 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:59:47,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:59:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-14 02:59:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744996649] [2024-11-14 02:59:47,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:59:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:59:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:47,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:59:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2024-11-14 02:59:47,301 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:47,369 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-14 02:59:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:59:47,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 10 [2024-11-14 02:59:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:47,370 INFO L225 Difference]: With dead ends: 44 [2024-11-14 02:59:47,370 INFO L226 Difference]: Without dead ends: 44 [2024-11-14 02:59:47,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2024-11-14 02:59:47,371 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:47,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-14 02:59:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-14 02:59:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-14 02:59:47,380 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2024-11-14 02:59:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:47,380 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-14 02:59:47,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-14 02:59:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 02:59:47,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:47,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-14 02:59:47,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:59:47,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:59:47,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:47,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -844285325, now seen corresponding path program 2 times [2024-11-14 02:59:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501299497] [2024-11-14 02:59:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 02:59:47,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:47,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501299497] [2024-11-14 02:59:47,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501299497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:47,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:47,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:59:47,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372237288] [2024-11-14 02:59:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:47,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:59:47,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:47,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:59:47,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:59:47,773 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:47,925 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-11-14 02:59:47,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:59:47,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2024-11-14 02:59:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:47,926 INFO L225 Difference]: With dead ends: 47 [2024-11-14 02:59:47,926 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 02:59:47,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:59:47,927 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:47,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 58 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 02:59:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-14 02:59:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.71875) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-14 02:59:47,934 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 15 [2024-11-14 02:59:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-14 02:59:47,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-14 02:59:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 02:59:47,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:47,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-14 02:59:47,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 02:59:47,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:47,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -844285324, now seen corresponding path program 1 times [2024-11-14 02:59:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295015073] [2024-11-14 02:59:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:59:48,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295015073] [2024-11-14 02:59:48,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295015073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:48,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 02:59:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020445186] [2024-11-14 02:59:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:48,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 02:59:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 02:59:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:59:48,293 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:48,497 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-14 02:59:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:59:48,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2024-11-14 02:59:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:48,499 INFO L225 Difference]: With dead ends: 47 [2024-11-14 02:59:48,499 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 02:59:48,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-14 02:59:48,501 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:48,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:59:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 02:59:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-14 02:59:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.65625) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-14 02:59:48,507 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 15 [2024-11-14 02:59:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:48,507 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-14 02:59:48,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-14 02:59:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 02:59:48,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:48,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:48,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 02:59:48,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:48,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:48,509 INFO L85 PathProgramCache]: Analyzing trace with hash -399436751, now seen corresponding path program 1 times [2024-11-14 02:59:48,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:48,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124518442] [2024-11-14 02:59:48,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:59:48,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124518442] [2024-11-14 02:59:48,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124518442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:48,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:59:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116870136] [2024-11-14 02:59:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:59:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:59:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:59:48,621 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:48,685 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-11-14 02:59:48,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:59:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 16 [2024-11-14 02:59:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:48,687 INFO L225 Difference]: With dead ends: 70 [2024-11-14 02:59:48,687 INFO L226 Difference]: Without dead ends: 70 [2024-11-14 02:59:48,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:59:48,689 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:48,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-14 02:59:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2024-11-14 02:59:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-14 02:59:48,697 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 16 [2024-11-14 02:59:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-14 02:59:48,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-14 02:59:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 02:59:48,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:48,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:48,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 02:59:48,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:48,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash 387402578, now seen corresponding path program 1 times [2024-11-14 02:59:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:48,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883017296] [2024-11-14 02:59:48,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:48,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:59:48,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883017296] [2024-11-14 02:59:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883017296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:48,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:59:48,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750314564] [2024-11-14 02:59:48,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:48,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:59:48,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:48,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:59:48,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:59:48,817 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:48,885 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-11-14 02:59:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:59:48,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2024-11-14 02:59:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:48,886 INFO L225 Difference]: With dead ends: 62 [2024-11-14 02:59:48,886 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 02:59:48,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:59:48,887 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:48,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 02:59:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-11-14 02:59:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.6) internal successors, (56), 49 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) [2024-11-14 02:59:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-14 02:59:48,895 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 17 [2024-11-14 02:59:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:48,896 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-14 02:59:48,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-14 02:59:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 02:59:48,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:48,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:48,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 02:59:48,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:48,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1814255184, now seen corresponding path program 1 times [2024-11-14 02:59:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:48,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320658809] [2024-11-14 02:59:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:59:49,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320658809] [2024-11-14 02:59:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320658809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:59:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:59:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:59:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605662091] [2024-11-14 02:59:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:59:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:59:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:59:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:59:49,089 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:49,211 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-11-14 02:59:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:59:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 19 [2024-11-14 02:59:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:49,212 INFO L225 Difference]: With dead ends: 54 [2024-11-14 02:59:49,212 INFO L226 Difference]: Without dead ends: 54 [2024-11-14 02:59:49,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:59:49,214 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:49,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 61 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-14 02:59:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-14 02:59:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.631578947368421) 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) [2024-11-14 02:59:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-14 02:59:49,222 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 19 [2024-11-14 02:59:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:49,223 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-14 02:59:49,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-14 02:59:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 02:59:49,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:49,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:49,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 02:59:49,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 02:59:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1814255185, now seen corresponding path program 1 times [2024-11-14 02:59:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524503969] [2024-11-14 02:59:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:59:49,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524503969] [2024-11-14 02:59:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524503969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:59:49,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472659906] [2024-11-14 02:59:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:49,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:59:49,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:59:49,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:59:49,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:59:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:49,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 02:59:49,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:59:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:59:49,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:59:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:59:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472659906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:59:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1538261766] [2024-11-14 02:59:49,636 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-14 02:59:49,636 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:59:49,637 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:59:49,637 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:59:49,637 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:59:51,385 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:00:20,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1538261766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:00:20,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:00:20,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 16 [2024-11-14 03:00:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072172643] [2024-11-14 03:00:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:20,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:00:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:00:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=190, Unknown=5, NotChecked=0, Total=272 [2024-11-14 03:00:20,605 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:25,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:00:29,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:00:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:30,936 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-14 03:00:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:00:30,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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 19 [2024-11-14 03:00:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:30,937 INFO L225 Difference]: With dead ends: 57 [2024-11-14 03:00:30,937 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 03:00:30,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=77, Invalid=190, Unknown=5, NotChecked=0, Total=272 [2024-11-14 03:00:30,938 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:30,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 3 Unknown, 0 Unchecked, 10.3s Time] [2024-11-14 03:00:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 03:00:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-14 03:00:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-11-14 03:00:30,942 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 19 [2024-11-14 03:00:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:30,942 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-11-14 03:00:30,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-14 03:00:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:00:30,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:30,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:30,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:00:31,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:31,144 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:31,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 294862647, now seen corresponding path program 1 times [2024-11-14 03:00:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381684813] [2024-11-14 03:00:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:00:32,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381684813] [2024-11-14 03:00:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381684813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443370425] [2024-11-14 03:00:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:32,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:32,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:32,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:00:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:32,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 03:00:32,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:32,209 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:00:32,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 03:00:32,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:00:32,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:00:32,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-14 03:00:32,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 03:00:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:00:32,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:00:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443370425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:00:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1890249826] [2024-11-14 03:00:32,838 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:00:32,838 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:00:32,839 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:00:32,839 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:00:32,839 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:00:33,449 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:00:40,121 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1576#(exists ((|v_ULTIMATE.start_sll_update_at_~head#1.base_40| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_update_at_~head#1.base_40|) 1)))' at error location [2024-11-14 03:00:40,121 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:00:40,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:00:40,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-11-14 03:00:40,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583461270] [2024-11-14 03:00:40,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:00:40,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 03:00:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 03:00:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=770, Unknown=3, NotChecked=0, Total=870 [2024-11-14 03:00:40,123 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:40,822 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-11-14 03:00:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:00:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 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 20 [2024-11-14 03:00:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:40,823 INFO L225 Difference]: With dead ends: 69 [2024-11-14 03:00:40,823 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 03:00:40,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=156, Invalid=1101, Unknown=3, NotChecked=0, Total=1260 [2024-11-14 03:00:40,825 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:40,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 224 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:00:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 03:00:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2024-11-14 03:00:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 59 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2024-11-14 03:00:40,828 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 20 [2024-11-14 03:00:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:40,828 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2024-11-14 03:00:40,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2024-11-14 03:00:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:00:40,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:40,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:40,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 03:00:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 03:00:41,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash 294862648, now seen corresponding path program 1 times [2024-11-14 03:00:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333970601] [2024-11-14 03:00:41,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:00:41,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333970601] [2024-11-14 03:00:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333970601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457431651] [2024-11-14 03:00:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:41,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:42,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:42,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:00:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:42,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 03:00:42,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:42,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:00:42,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:00:42,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:00:42,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:00:42,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:00:42,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:00:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:00:42,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-14 03:00:42,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:00:42,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 03:00:42,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 03:00:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:00:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:00:42,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:42,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_563 (Array Int Int))) (or (not (= v_ArrVal_563 (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_563 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_562 (Array Int Int))) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (not (= v_ArrVal_562 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_562 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) (forall ((v_ArrVal_562 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)) (not (= v_ArrVal_562 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_562 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-14 03:00:43,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:43,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-14 03:00:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-14 03:00:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457431651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:00:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [774883885] [2024-11-14 03:00:43,352 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:00:43,352 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:00:43,352 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:00:43,352 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:00:43,352 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:00:43,876 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:00:44,372 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1723#true' at error location [2024-11-14 03:00:44,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:00:44,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:00:44,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2024-11-14 03:00:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522913064] [2024-11-14 03:00:44,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:00:44,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 03:00:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 03:00:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1082, Unknown=2, NotChecked=66, Total=1260 [2024-11-14 03:00:44,375 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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) [2024-11-14 03:00:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:45,408 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2024-11-14 03:00:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:00:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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) Word has length 20 [2024-11-14 03:00:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:45,409 INFO L225 Difference]: With dead ends: 94 [2024-11-14 03:00:45,409 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 03:00:45,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=198, Invalid=1610, Unknown=2, NotChecked=82, Total=1892 [2024-11-14 03:00:45,411 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:45,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 342 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 683 Invalid, 0 Unknown, 69 Unchecked, 0.6s Time] [2024-11-14 03:00:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 03:00:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2024-11-14 03:00:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.62) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2024-11-14 03:00:45,423 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 20 [2024-11-14 03:00:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:45,423 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2024-11-14 03:00:45,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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) [2024-11-14 03:00:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2024-11-14 03:00:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:00:45,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:45,424 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-14 03:00:45,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:00:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 03:00:45,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:45,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -108056810, now seen corresponding path program 2 times [2024-11-14 03:00:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629915679] [2024-11-14 03:00:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:00:45,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:45,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629915679] [2024-11-14 03:00:45,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629915679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:45,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207316261] [2024-11-14 03:00:45,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:00:45,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:45,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:45,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:45,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:00:45,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:00:45,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:00:45,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:00:45,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:00:45,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:00:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207316261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:00:45,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [332385671] [2024-11-14 03:00:45,960 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:00:45,960 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:00:45,961 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:00:45,961 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:00:45,961 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:00:46,694 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:00:53,030 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2182#(exists ((|v_ULTIMATE.start_sll_update_at_~head#1.base_73| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) 1)))' at error location [2024-11-14 03:00:53,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:00:53,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:00:53,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-14 03:00:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481207227] [2024-11-14 03:00:53,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:00:53,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:00:53,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:00:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=121, Unknown=4, NotChecked=0, Total=156 [2024-11-14 03:00:53,032 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:53,148 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2024-11-14 03:00:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:00:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 22 [2024-11-14 03:00:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:53,149 INFO L225 Difference]: With dead ends: 101 [2024-11-14 03:00:53,149 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 03:00:53,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=50, Invalid=186, Unknown=4, NotChecked=0, Total=240 [2024-11-14 03:00:53,150 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:53,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 87 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 03:00:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2024-11-14 03:00:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 69 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) [2024-11-14 03:00:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2024-11-14 03:00:53,157 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 22 [2024-11-14 03:00:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:53,157 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2024-11-14 03:00:53,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2024-11-14 03:00:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:00:53,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:53,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:53,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 03:00:53,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:00:53,358 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:53,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1875814123, now seen corresponding path program 1 times [2024-11-14 03:00:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:53,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836460830] [2024-11-14 03:00:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:00:53,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836460830] [2024-11-14 03:00:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836460830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:00:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:00:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:00:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333343876] [2024-11-14 03:00:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:53,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:00:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:00:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:00:53,612 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:53,837 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-11-14 03:00:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:00:53,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 24 [2024-11-14 03:00:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:53,838 INFO L225 Difference]: With dead ends: 70 [2024-11-14 03:00:53,838 INFO L226 Difference]: Without dead ends: 70 [2024-11-14 03:00:53,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:00:53,839 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:53,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 99 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:00:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-14 03:00:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-14 03:00:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2024-11-14 03:00:53,845 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 24 [2024-11-14 03:00:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:53,846 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2024-11-14 03:00:53,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2024-11-14 03:00:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:00:53,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:53,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-11-14 03:00:53,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:00:53,847 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:53,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2074549679, now seen corresponding path program 3 times [2024-11-14 03:00:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789832573] [2024-11-14 03:00:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:00:53,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789832573] [2024-11-14 03:00:53,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789832573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523450701] [2024-11-14 03:00:53,946 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:00:53,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:53,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:53,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:53,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:00:54,110 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:00:54,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:00:54,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:00:54,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:00:54,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:00:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523450701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:00:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1427045909] [2024-11-14 03:00:54,175 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:00:54,175 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:00:54,175 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:00:54,175 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:00:54,176 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:00:54,675 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:00:55,248 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2668#(and (exists ((|v_ULTIMATE.start_sll_update_at_~head#1.base_88| Int) (|v_ULTIMATE.start_sll_update_at_~index#1_88| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_update_at_~head#1.base_88|) 1)) (or (and (= |ULTIMATE.start_sll_update_at_~data#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_sll_update_at_~index#1_88|) (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |v_ULTIMATE.start_sll_update_at_~head#1.base_88| |ULTIMATE.start_main_~s~0#1.base|)) (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |v_ULTIMATE.start_sll_update_at_~index#1_88| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= 3 |ULTIMATE.start_sll_update_at_~data#1|) (= |v_ULTIMATE.start_sll_update_at_~head#1.base_88| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1))) (<= |v_ULTIMATE.start_sll_update_at_~index#1_88| 0))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-14 03:00:55,248 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:00:55,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:00:55,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-14 03:00:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806778133] [2024-11-14 03:00:55,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:00:55,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:00:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:00:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:00:55,250 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:55,348 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-11-14 03:00:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:00:55,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2024-11-14 03:00:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:55,349 INFO L225 Difference]: With dead ends: 78 [2024-11-14 03:00:55,349 INFO L226 Difference]: Without dead ends: 78 [2024-11-14 03:00:55,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:00:55,350 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:55,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 104 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-14 03:00:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2024-11-14 03:00:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.510204081632653) internal successors, (74), 63 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-11-14 03:00:55,353 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 25 [2024-11-14 03:00:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:55,354 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-11-14 03:00:55,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-11-14 03:00:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:00:55,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:55,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-11-14 03:00:55,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 03:00:55,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 03:00:55,555 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:55,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1866831091, now seen corresponding path program 4 times [2024-11-14 03:00:55,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:55,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495673359] [2024-11-14 03:00:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:00:55,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495673359] [2024-11-14 03:00:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495673359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635403774] [2024-11-14 03:00:55,668 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:00:55,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:55,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:55,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:55,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:00:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:55,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:00:55,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:00:55,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:00:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635403774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:00:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:00:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-14 03:00:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274573086] [2024-11-14 03:00:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:00:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:00:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:00:55,937 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:56,032 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-14 03:00:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:00:56,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 25 [2024-11-14 03:00:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:56,034 INFO L225 Difference]: With dead ends: 64 [2024-11-14 03:00:56,035 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 03:00:56,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:00:56,036 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 38 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:56,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 03:00:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2024-11-14 03:00:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 56 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-11-14 03:00:56,039 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 25 [2024-11-14 03:00:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:56,039 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-11-14 03:00:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:00:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-11-14 03:00:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:00:56,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:56,042 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:56,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:00:56,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 03:00:56,246 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:56,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:56,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1226625428, now seen corresponding path program 1 times [2024-11-14 03:00:56,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:56,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755975781] [2024-11-14 03:00:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:56,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:00:56,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755975781] [2024-11-14 03:00:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755975781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:00:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:00:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:00:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544889664] [2024-11-14 03:00:56,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:00:56,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:00:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:00:56,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:00:56,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:00:56,329 INFO L87 Difference]: Start difference. First operand 57 states and 68 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) [2024-11-14 03:00:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:00:56,403 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-14 03:00:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:00:56,403 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 26 [2024-11-14 03:00:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:00:56,406 INFO L225 Difference]: With dead ends: 56 [2024-11-14 03:00:56,406 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 03:00:56,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:00:56,406 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:00:56,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:00:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 03:00:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-14 03:00:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 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) [2024-11-14 03:00:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-14 03:00:56,411 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 26 [2024-11-14 03:00:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:00:56,411 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-14 03:00:56,411 INFO L472 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) [2024-11-14 03:00:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-14 03:00:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:00:56,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:00:56,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:00:56,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 03:00:56,412 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:00:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:00:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -557078549, now seen corresponding path program 1 times [2024-11-14 03:00:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:00:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574224678] [2024-11-14 03:00:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:00:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:00:57,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:00:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574224678] [2024-11-14 03:00:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574224678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:00:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68564276] [2024-11-14 03:00:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:00:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:00:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:00:57,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:00:57,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:00:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:00:57,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-14 03:00:57,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:00:57,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:00:57,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:00:57,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:00:57,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:00:57,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-14 03:00:57,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-14 03:00:57,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:00:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:00:58,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:00:58,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-14 03:00:58,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-14 03:00:58,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-14 03:00:58,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:58,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-14 03:00:58,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:00:58,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2024-11-14 03:00:58,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-14 03:00:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-14 03:00:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68564276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:00:58,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2107230842] [2024-11-14 03:00:58,646 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:00:58,646 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:00:58,647 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:00:58,647 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:00:58,647 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:01:01,818 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:01:14,252 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3335#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2147483648)) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-14 03:01:14,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:01:14,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:01:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2024-11-14 03:01:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194020579] [2024-11-14 03:01:14,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:01:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-14 03:01:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:01:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-14 03:01:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2268, Unknown=5, NotChecked=294, Total=2756 [2024-11-14 03:01:14,255 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 40 states, 40 states have (on average 1.825) internal successors, (73), 40 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:01:15,353 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-11-14 03:01:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 03:01:15,353 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.825) internal successors, (73), 40 states have internal predecessors, (73), 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 27 [2024-11-14 03:01:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:01:15,354 INFO L225 Difference]: With dead ends: 57 [2024-11-14 03:01:15,354 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 03:01:15,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=359, Invalid=3680, Unknown=5, NotChecked=378, Total=4422 [2024-11-14 03:01:15,355 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:01:15,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 425 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 675 Invalid, 0 Unknown, 133 Unchecked, 0.5s Time] [2024-11-14 03:01:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 03:01:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-14 03:01:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-11-14 03:01:15,357 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 27 [2024-11-14 03:01:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:01:15,358 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-14 03:01:15,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.825) internal successors, (73), 40 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-14 03:01:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:01:15,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:01:15,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:01:15,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:01:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:15,559 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:01:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:01:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash -91150129, now seen corresponding path program 1 times [2024-11-14 03:01:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:01:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777523964] [2024-11-14 03:01:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:01:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 03:01:15,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:01:15,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777523964] [2024-11-14 03:01:15,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777523964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:01:15,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682058242] [2024-11-14 03:01:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:15,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:01:15,679 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:01:15,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:01:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:15,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:01:15,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:01:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:01:15,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:01:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:01:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682058242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:01:16,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [387499598] [2024-11-14 03:01:16,053 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:01:16,053 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:01:16,053 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:01:16,053 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:01:16,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:01:19,129 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:01:34,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [387499598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:01:34,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:01:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 22 [2024-11-14 03:01:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908302316] [2024-11-14 03:01:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:01:34,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:01:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:01:34,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:01:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=368, Unknown=3, NotChecked=0, Total=462 [2024-11-14 03:01:34,595 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:36,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:01:38,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:01:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:01:40,628 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-11-14 03:01:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:01:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 [2024-11-14 03:01:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:01:40,629 INFO L225 Difference]: With dead ends: 55 [2024-11-14 03:01:40,629 INFO L226 Difference]: Without dead ends: 54 [2024-11-14 03:01:40,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=115, Invalid=482, Unknown=3, NotChecked=0, Total=600 [2024-11-14 03:01:40,630 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:01:40,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2024-11-14 03:01:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-14 03:01:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-14 03:01:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-11-14 03:01:40,634 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 28 [2024-11-14 03:01:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:01:40,635 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-11-14 03:01:40,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:01:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-11-14 03:01:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:01:40,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:01:40,635 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:01:40,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:01:40,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-14 03:01:40,836 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:01:40,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:01:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1775285197, now seen corresponding path program 1 times [2024-11-14 03:01:40,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:01:40,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449589185] [2024-11-14 03:01:40,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:40,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:01:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:01:42,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:01:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449589185] [2024-11-14 03:01:42,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449589185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:01:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720515618] [2024-11-14 03:01:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:01:42,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:01:42,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:01:42,390 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:01:42,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:01:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:01:42,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 03:01:42,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:01:42,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:01:42,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:01:42,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:01:43,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:01:43,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-14 03:01:43,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:01:43,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-14 03:01:43,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 03:01:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:01:43,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:01:43,462 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-14 03:01:43,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 03:01:43,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1286) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2024-11-14 03:01:43,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (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_1285) |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_1285 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1285)))) is different from false [2024-11-14 03:01:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-14 03:01:43,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720515618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:01:43,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [234265493] [2024-11-14 03:01:43,785 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:01:43,785 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:01:43,786 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:01:43,786 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:01:43,786 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:01:46,916 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:02:07,847 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3996#(exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_42| Int)) (and (exists ((|v_ULTIMATE.start_sll_get_data_at_~index#1_38| Int)) (and (or (and (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_42| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)) (and (= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_sll_get_data_at_~index#1_38|) (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_42| |ULTIMATE.start_main_~s~0#1.base|))) (or (and (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |v_ULTIMATE.start_sll_get_data_at_~index#1_38| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) (= |v_ULTIMATE.start_sll_get_data_at_~index#1_38| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_42|) 1))))' at error location [2024-11-14 03:02:07,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:02:07,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 35 [2024-11-14 03:02:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210018318] [2024-11-14 03:02:07,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:07,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 03:02:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 03:02:07,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2100, Unknown=14, NotChecked=186, Total=2450 [2024-11-14 03:02:07,850 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 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) [2024-11-14 03:02:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:09,963 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-14 03:02:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:02:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 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) Word has length 30 [2024-11-14 03:02:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:09,964 INFO L225 Difference]: With dead ends: 61 [2024-11-14 03:02:09,964 INFO L226 Difference]: Without dead ends: 61 [2024-11-14 03:02:09,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=313, Invalid=3713, Unknown=14, NotChecked=250, Total=4290 [2024-11-14 03:02:09,967 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 167 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:09,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 360 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1021 Invalid, 0 Unknown, 106 Unchecked, 1.1s Time] [2024-11-14 03:02:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-14 03:02:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-14 03:02:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 56 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) [2024-11-14 03:02:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-14 03:02:09,970 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 30 [2024-11-14 03:02:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:09,970 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-14 03:02:09,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 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) [2024-11-14 03:02:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-14 03:02:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:02:09,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:09,971 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:09,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:02:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:10,172 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:02:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1775285196, now seen corresponding path program 1 times [2024-11-14 03:02:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183855959] [2024-11-14 03:02:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:02:11,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183855959] [2024-11-14 03:02:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183855959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99197060] [2024-11-14 03:02:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:11,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:11,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:11,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:02:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:11,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-14 03:02:12,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:02:12,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:02:12,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:02:12,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:02:12,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:02:12,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:02:12,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:02:12,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 03:02:12,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:02:12,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-14 03:02:12,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:02:12,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:02:12,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 03:02:12,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 03:02:12,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:02:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:02:12,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:13,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1397 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1398) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:02:13,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1398) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1397 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-14 03:02:13,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1395 (Array Int Int))) (or (forall ((v_ArrVal_1396 (Array Int Int))) (or (forall ((v_ArrVal_1397 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1396) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (not (= v_ArrVal_1396 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1396 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (not (= v_ArrVal_1395 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1395 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1395 (Array Int Int))) (or (forall ((v_ArrVal_1396 (Array Int Int))) (or (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1395))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1396) .cse3 v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1398) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) (not (= v_ArrVal_1396 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1396 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (not (= v_ArrVal_1395 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1395 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-14 03:02:13,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_123| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|) (forall ((v_ArrVal_1395 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123| (select v_ArrVal_1395 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|)) v_ArrVal_1395)) (forall ((v_ArrVal_1396 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123| (select v_ArrVal_1396 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|)) v_ArrVal_1396)) (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (let ((.cse2 (select v_ArrVal_1395 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1396) .cse2 v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1395) .cse2 v_ArrVal_1398) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_123| Int) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|) (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123| (select v_ArrVal_1396 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|)) v_ArrVal_1396)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1396) (select .cse0 .cse3) v_ArrVal_1397) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)))))) is different from false [2024-11-14 03:02:13,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_123| Int) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1396) (select .cse0 .cse1) v_ArrVal_1397) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 1)) (not (= v_ArrVal_1396 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123| (select v_ArrVal_1396 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_123| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|) (forall ((v_ArrVal_1395 (Array Int Int))) (or (forall ((v_ArrVal_1396 (Array Int Int))) (or (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1395 .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1396) .cse3 v_ArrVal_1397) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1395) .cse3 v_ArrVal_1398) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) (not (= v_ArrVal_1396 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123| (select v_ArrVal_1396 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|)))))) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123| (select v_ArrVal_1395 |v_ULTIMATE.start_sll_update_at_~head#1.offset_123|)) v_ArrVal_1395)))))))) is different from false [2024-11-14 03:02:13,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2024-11-14 03:02:13,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 128 [2024-11-14 03:02:13,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-14 03:02:13,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-14 03:02:13,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:02:13,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:02:13,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:02:13,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-14 03:02:13,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-14 03:02:13,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:02:13,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-14 03:02:13,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:02:13,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:02:13,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-14 03:02:13,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 03:02:13,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:02:13,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-14 03:02:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-14 03:02:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99197060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [275512310] [2024-11-14 03:02:14,134 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:02:14,134 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:02:14,134 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:02:14,134 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:02:14,134 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:02:15,326 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:02:42,598 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4383#(exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_70| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_66| Int)) (and (or (< (select |#length| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_70|) (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_66| 4)) (< |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_66| 0)) (exists ((|v_ULTIMATE.start_sll_get_data_at_~index#1_65| Int)) (and (or (and (= |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_66| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_sll_get_data_at_~index#1_65|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_70| |ULTIMATE.start_main_~s~0#1.base|)) (and (= |v_ULTIMATE.start_sll_get_data_at_~index#1_65| 0) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_65| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.base_69| Int)) (and (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_69|) (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_65| 4))) (<= (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_65| 8) (select |#length| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_69|)) (<= 0 (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_65| 4)) (= (select |#valid| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_69|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_69|) (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_65| 4)) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_66|))))) (<= |v_ULTIMATE.start_sll_get_data_at_~index#1_65| 0)))))' at error location [2024-11-14 03:02:42,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:02:42,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:02:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 15] total 46 [2024-11-14 03:02:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570935702] [2024-11-14 03:02:42,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:02:42,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-14 03:02:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:02:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-14 03:02:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2469, Unknown=33, NotChecked=520, Total=3192 [2024-11-14 03:02:42,600 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 47 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 47 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:02:45,341 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-11-14 03:02:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:02:45,342 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 47 states have internal predecessors, (88), 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 30 [2024-11-14 03:02:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:02:45,343 INFO L225 Difference]: With dead ends: 61 [2024-11-14 03:02:45,343 INFO L226 Difference]: Without dead ends: 61 [2024-11-14 03:02:45,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=423, Invalid=4526, Unknown=41, NotChecked=710, Total=5700 [2024-11-14 03:02:45,344 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 111 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:02:45,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 428 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 974 Invalid, 0 Unknown, 265 Unchecked, 1.0s Time] [2024-11-14 03:02:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-14 03:02:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-14 03:02:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-14 03:02:45,347 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 30 [2024-11-14 03:02:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:02:45,347 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-14 03:02:45,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 47 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:02:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-14 03:02:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:02:45,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:02:45,348 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:02:45,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 03:02:45,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-14 03:02:45,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:02:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:02:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash 872972588, now seen corresponding path program 1 times [2024-11-14 03:02:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:02:45,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786955918] [2024-11-14 03:02:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:02:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:02:45,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:02:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786955918] [2024-11-14 03:02:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786955918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:02:45,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425566949] [2024-11-14 03:02:45,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:02:45,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:02:45,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:02:45,660 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:02:45,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:02:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:02:45,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:02:45,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:02:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:02:45,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:02:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:02:45,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425566949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:02:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1046333307] [2024-11-14 03:02:45,977 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:02:45,977 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:02:45,977 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:02:45,977 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:02:45,978 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:02:47,474 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:03:01,698 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4737#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2147483648)) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-14 03:03:01,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:03:01,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:03:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-14 03:03:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549945103] [2024-11-14 03:03:01,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:03:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:03:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:03:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=277, Unknown=2, NotChecked=0, Total=342 [2024-11-14 03:03:01,700 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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) [2024-11-14 03:03:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:01,806 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-11-14 03:03:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:03:01,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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) Word has length 31 [2024-11-14 03:03:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:01,807 INFO L225 Difference]: With dead ends: 55 [2024-11-14 03:03:01,807 INFO L226 Difference]: Without dead ends: 55 [2024-11-14 03:03:01,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=68, Invalid=310, Unknown=2, NotChecked=0, Total=380 [2024-11-14 03:03:01,808 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:01,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-14 03:03:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-14 03:03:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 54 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) [2024-11-14 03:03:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-11-14 03:03:01,810 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 31 [2024-11-14 03:03:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:01,810 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-11-14 03:03:01,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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) [2024-11-14 03:03:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-11-14 03:03:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:03:01,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:01,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:01,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 03:03:02,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-14 03:03:02,012 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:03:02,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash -949323533, now seen corresponding path program 2 times [2024-11-14 03:03:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:02,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637801334] [2024-11-14 03:03:02,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:02,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:03:02,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:02,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637801334] [2024-11-14 03:03:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637801334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:03:02,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347950189] [2024-11-14 03:03:02,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:03:02,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:03:02,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:02,139 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:03:02,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:03:02,385 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:03:02,385 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:03:02,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:03:02,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:03:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:03:02,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:03:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:03:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347950189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:03:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2144198409] [2024-11-14 03:03:02,476 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:03:02,476 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:03:02,477 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:03:02,477 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:03:02,477 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:03:03,698 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:03:20,399 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5055#(exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_103| Int)) (and (exists ((|v_ULTIMATE.start_sll_get_data_at_~index#1_102| Int)) (and (or (and (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_103| |ULTIMATE.start_main_~s~0#1.base|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_sll_get_data_at_~index#1_102|)) (and (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_102| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_98| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_102|) (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_98| 4)) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (<= (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_98| 8) (select |#length| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_102|)) (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_103| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_102|) (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_98| 4))) (<= 0 (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_98| 4)) (= (select |#valid| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_102|) 1))) (= |v_ULTIMATE.start_sll_get_data_at_~index#1_102| 0))) (<= |v_ULTIMATE.start_sll_get_data_at_~index#1_102| 0))) (not (= (select |#valid| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_103|) 1))))' at error location [2024-11-14 03:03:20,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:03:20,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:03:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-14 03:03:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80901208] [2024-11-14 03:03:20,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:03:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:03:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:03:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=235, Unknown=1, NotChecked=0, Total=272 [2024-11-14 03:03:20,401 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:20,570 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2024-11-14 03:03:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:03:20,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 32 [2024-11-14 03:03:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:20,571 INFO L225 Difference]: With dead ends: 47 [2024-11-14 03:03:20,571 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 03:03:20,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=55, Invalid=324, Unknown=1, NotChecked=0, Total=380 [2024-11-14 03:03:20,572 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:20,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 03:03:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-14 03:03:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.2) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-14 03:03:20,574 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 32 [2024-11-14 03:03:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:20,574 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-14 03:03:20,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-14 03:03:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:03:20,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:20,575 INFO L215 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] [2024-11-14 03:03:20,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-14 03:03:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 03:03:20,779 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:03:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 707980396, now seen corresponding path program 1 times [2024-11-14 03:03:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914790147] [2024-11-14 03:03:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:22,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:22,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914790147] [2024-11-14 03:03:22,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914790147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:03:22,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576888423] [2024-11-14 03:03:22,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:22,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:03:22,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:22,554 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:03:22,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 03:03:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:22,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-14 03:03:22,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:03:22,874 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:03:22,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:03:22,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:03:23,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:03:23,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-14 03:03:23,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:03:23,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-14 03:03:23,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 03:03:23,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-14 03:03:23,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-14 03:03:23,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:03:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:24,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:03:24,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2024-11-14 03:03:24,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:24,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-14 03:03:24,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 03:03:24,678 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1712 (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_1712) |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_1712 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1712)))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2024-11-14 03:03:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-14 03:03:24,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576888423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:03:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924940628] [2024-11-14 03:03:24,995 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:03:24,996 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:03:24,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:03:24,996 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:03:24,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:03:26,147 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:03:41,246 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5407#(exists ((|v_ULTIMATE.start_main_~expected~0#1_54| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127| Int) (|v_ULTIMATE.start_sll_get_data_at_~index#1_130| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.base_132| Int)) (and (<= 0 (+ (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_132|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127|) 2147483648)) (or (and (= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_sll_get_data_at_~index#1_130|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (= |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127| |ULTIMATE.start_main_~s~0#1.offset|) (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_132| |ULTIMATE.start_main_~s~0#1.base|) (= |v_ULTIMATE.start_main_~expected~0#1_54| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_126| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.base_131| Int)) (and (= |v_ULTIMATE.start_sll_get_data_at_~head#1.base_132| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_131|) (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_126| 4))) (= (select |#valid| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_131|) 1) (<= 0 (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_126| 4)) (<= (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_126| 8) (select |#length| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_131|)) (= |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_131|) (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_126| 4))))) (= |v_ULTIMATE.start_sll_get_data_at_~index#1_130| 0))) (= (select |#valid| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_132|) 1) (not (= |v_ULTIMATE.start_main_~expected~0#1_54| (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_132|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127|))) (<= 0 |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127|) (<= |v_ULTIMATE.start_sll_get_data_at_~index#1_130| 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_132|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127|) 2147483647) (<= (+ |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_127| 4) (select |#length| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_132|))))' at error location [2024-11-14 03:03:41,247 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:03:41,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:03:41,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 50 [2024-11-14 03:03:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984233527] [2024-11-14 03:03:41,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:03:41,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-14 03:03:41,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:41,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-14 03:03:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3223, Unknown=20, NotChecked=114, Total=3540 [2024-11-14 03:03:41,249 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 50 states, 50 states have (on average 1.82) internal successors, (91), 50 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:44,014 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-11-14 03:03:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 03:03:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.82) internal successors, (91), 50 states have internal predecessors, (91), 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 [2024-11-14 03:03:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:44,015 INFO L225 Difference]: With dead ends: 48 [2024-11-14 03:03:44,015 INFO L226 Difference]: Without dead ends: 48 [2024-11-14 03:03:44,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=410, Invalid=5577, Unknown=23, NotChecked=152, Total=6162 [2024-11-14 03:03:44,018 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:44,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 410 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1032 Invalid, 0 Unknown, 37 Unchecked, 1.2s Time] [2024-11-14 03:03:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-14 03:03:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-14 03:03:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 43 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) [2024-11-14 03:03:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-11-14 03:03:44,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 33 [2024-11-14 03:03:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:44,020 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-11-14 03:03:44,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.82) internal successors, (91), 50 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-11-14 03:03:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:03:44,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:44,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:44,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-14 03:03:44,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-14 03:03:44,224 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:03:44,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash 470971502, now seen corresponding path program 1 times [2024-11-14 03:03:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:44,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681657239] [2024-11-14 03:03:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 03:03:44,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681657239] [2024-11-14 03:03:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681657239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:03:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456462309] [2024-11-14 03:03:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:44,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:03:44,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:44,326 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:03:44,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 03:03:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:44,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 03:03:44,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:03:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 03:03:44,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:03:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456462309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:44,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:03:44,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 03:03:44,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243639369] [2024-11-14 03:03:44,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:03:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:44,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:03:44,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:03:44,661 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:44,818 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-14 03:03:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:03:44,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 [2024-11-14 03:03:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:44,819 INFO L225 Difference]: With dead ends: 45 [2024-11-14 03:03:44,819 INFO L226 Difference]: Without dead ends: 45 [2024-11-14 03:03:44,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:03:44,820 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:44,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 26 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-14 03:03:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-14 03:03:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.2) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-14 03:03:44,821 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 34 [2024-11-14 03:03:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:44,822 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-14 03:03:44,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-14 03:03:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:03:44,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:44,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:44,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-14 03:03:45,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-14 03:03:45,029 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:03:45,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 470971503, now seen corresponding path program 1 times [2024-11-14 03:03:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951169231] [2024-11-14 03:03:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 03:03:45,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:45,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951169231] [2024-11-14 03:03:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951169231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:45,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:03:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602151537] [2024-11-14 03:03:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:45,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:03:45,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:03:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:03:45,276 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:45,556 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-11-14 03:03:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:03:45,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 [2024-11-14 03:03:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:45,558 INFO L225 Difference]: With dead ends: 46 [2024-11-14 03:03:45,558 INFO L226 Difference]: Without dead ends: 46 [2024-11-14 03:03:45,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:03:45,559 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:45,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-14 03:03:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-14 03:03:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.170731707317073) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-11-14 03:03:45,563 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 34 [2024-11-14 03:03:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:45,564 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-11-14 03:03:45,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2024-11-14 03:03:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:03:45,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:45,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:45,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 03:03:45,566 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:03:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash 470972922, now seen corresponding path program 1 times [2024-11-14 03:03:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:45,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392018883] [2024-11-14 03:03:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:45,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 03:03:45,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392018883] [2024-11-14 03:03:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392018883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:03:45,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921502951] [2024-11-14 03:03:45,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:45,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:03:45,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:45,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:03:45,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:03:45,710 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:45,939 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-14 03:03:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:03:45,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 [2024-11-14 03:03:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:45,940 INFO L225 Difference]: With dead ends: 48 [2024-11-14 03:03:45,940 INFO L226 Difference]: Without dead ends: 48 [2024-11-14 03:03:45,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:03:45,941 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:45,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-14 03:03:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-14 03:03:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-11-14 03:03:45,943 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 34 [2024-11-14 03:03:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:45,943 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-14 03:03:45,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-11-14 03:03:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:03:45,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:45,946 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:45,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-14 03:03:45,946 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:03:45,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1632084818, now seen corresponding path program 1 times [2024-11-14 03:03:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:45,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251702619] [2024-11-14 03:03:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 03:03:46,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251702619] [2024-11-14 03:03:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251702619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:46,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:46,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:03:46,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534978815] [2024-11-14 03:03:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:46,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:03:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:46,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:03:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:03:46,084 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:46,230 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2024-11-14 03:03:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:03:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 36 [2024-11-14 03:03:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:46,231 INFO L225 Difference]: With dead ends: 47 [2024-11-14 03:03:46,231 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 03:03:46,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:03:46,232 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:46,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 44 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 03:03:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-14 03:03:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-14 03:03:46,233 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2024-11-14 03:03:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:46,234 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-14 03:03:46,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-14 03:03:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:03:46,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:46,234 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:03:46,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-14 03:03:46,234 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:03:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1885792373, now seen corresponding path program 1 times [2024-11-14 03:03:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113782944] [2024-11-14 03:03:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:03:47,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113782944] [2024-11-14 03:03:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113782944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:03:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092445912] [2024-11-14 03:03:47,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:03:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:47,384 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:03:47,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 03:03:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:47,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:03:47,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:03:47,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:03:47,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:03:47,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:03:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:03:47,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 03:03:47,981 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:03:47,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 03:03:48,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:48,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-14 03:03:48,229 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:03:48,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:03:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:03:48,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:03:48,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:48,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2024-11-14 03:03:48,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2083 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2083 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2083)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2083) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_ArrVal_2083 (Array Int Int))) (or (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2083) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select .cse1 4))) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2083 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2083)))))) is different from false [2024-11-14 03:03:48,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-14 03:03:48,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2024-11-14 03:03:48,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-14 03:03:48,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:03:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 3 not checked. [2024-11-14 03:03:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092445912] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:03:49,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069491757] [2024-11-14 03:03:49,021 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:03:49,021 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:03:49,021 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:03:49,021 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:03:49,021 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:03:50,193 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:04:31,349 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6316#(exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_28| Int)) (and (or (not (= |v_ULTIMATE.start_sll_destroy_~head#1.base_28| 0)) (not (= |ULTIMATE.start_sll_destroy_~head#1.offset| 0))) (not (= (select |#valid| |v_ULTIMATE.start_sll_destroy_~head#1.base_28|) 1))))' at error location [2024-11-14 03:04:31,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:04:31,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:04:31,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 32 [2024-11-14 03:04:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618897143] [2024-11-14 03:04:31,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:04:31,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 03:04:31,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:31,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 03:04:31,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1906, Unknown=13, NotChecked=88, Total=2162 [2024-11-14 03:04:31,351 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 33 states, 32 states have (on average 2.40625) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:42,483 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-11-14 03:04:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:04:42,484 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 33 states have internal predecessors, (77), 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 39 [2024-11-14 03:04:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:42,484 INFO L225 Difference]: With dead ends: 54 [2024-11-14 03:04:42,484 INFO L226 Difference]: Without dead ends: 54 [2024-11-14 03:04:42,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=221, Invalid=2522, Unknown=17, NotChecked=102, Total=2862 [2024-11-14 03:04:42,486 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:42,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 95 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 602 Invalid, 0 Unknown, 47 Unchecked, 0.7s Time] [2024-11-14 03:04:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-14 03:04:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-14 03:04:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-14 03:04:42,487 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2024-11-14 03:04:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:42,488 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-14 03:04:42,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-11-14 03:04:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:04:42,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:42,488 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:04:42,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 03:04:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-14 03:04:42,689 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:04:42,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:42,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1885792372, now seen corresponding path program 1 times [2024-11-14 03:04:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92805597] [2024-11-14 03:04:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:04:45,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92805597] [2024-11-14 03:04:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92805597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:04:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103439140] [2024-11-14 03:04:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:45,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:04:45,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:04:45,696 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:04:45,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 03:04:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:45,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-14 03:04:45,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:04:45,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:04:46,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:04:46,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:04:46,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:04:46,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:04:46,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:04:46,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:04:46,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:04:46,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:04:46,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 03:04:46,907 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:04:46,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 03:04:46,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 03:04:47,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:47,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-14 03:04:47,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:47,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-14 03:04:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:04:47,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:04:48,481 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2196 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2196 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2196)) (forall ((v_ArrVal_2197 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2197))) (or (not (= v_ArrVal_2197 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2197 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0) (forall ((v_ArrVal_2198 (Array Int Int))) (<= 0 (+ (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2196) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_2198) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))))) (forall ((v_ArrVal_2196 (Array Int Int))) (or (forall ((v_ArrVal_2197 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2197))) (or (forall ((v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2198 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2196))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_2198) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2199) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (not (= v_ArrVal_2197 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2197 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)))) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2196 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2196)))))) is different from false [2024-11-14 03:04:52,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 78 [2024-11-14 03:04:52,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 112 [2024-11-14 03:04:52,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:52,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 87 [2024-11-14 03:04:52,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-14 03:04:52,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 03:04:52,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:52,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 135 [2024-11-14 03:04:52,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-14 03:04:52,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:52,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:52,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-14 03:04:53,286 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:04:53,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-14 03:04:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 1 times theorem prover too weak. 8 trivial. 3 not checked. [2024-11-14 03:04:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103439140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:04:53,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1967722008] [2024-11-14 03:04:53,530 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:04:53,530 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:04:53,530 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:04:53,530 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:04:53,530 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:04:56,929 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:05:15,005 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6449#true' at error location [2024-11-14 03:05:15,006 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:05:15,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:05:15,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 17] total 54 [2024-11-14 03:05:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811056471] [2024-11-14 03:05:15,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:05:15,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-14 03:05:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:05:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-14 03:05:15,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=4209, Unknown=20, NotChecked=130, Total=4556 [2024-11-14 03:05:15,012 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 55 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 55 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:05:21,456 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-11-14 03:05:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:05:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 55 states have internal predecessors, (104), 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 39 [2024-11-14 03:05:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:05:21,457 INFO L225 Difference]: With dead ends: 55 [2024-11-14 03:05:21,457 INFO L226 Difference]: Without dead ends: 55 [2024-11-14 03:05:21,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=469, Invalid=7347, Unknown=20, NotChecked=174, Total=8010 [2024-11-14 03:05:21,460 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 113 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:05:21,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 101 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1625 Invalid, 0 Unknown, 54 Unchecked, 2.5s Time] [2024-11-14 03:05:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-14 03:05:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-14 03:05:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-11-14 03:05:21,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 39 [2024-11-14 03:05:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-14 03:05:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 55 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-11-14 03:05:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:05:21,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:21,465 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-14 03:05:21,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 03:05:21,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:05:21,666 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:05:21,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1885790953, now seen corresponding path program 1 times [2024-11-14 03:05:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:21,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393368292] [2024-11-14 03:05:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:05:22,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393368292] [2024-11-14 03:05:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393368292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:05:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675676179] [2024-11-14 03:05:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:05:22,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:05:22,503 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:05:22,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 03:05:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:22,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-14 03:05:22,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:05:22,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:05:22,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:05:22,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:05:23,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:23,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-14 03:05:23,298 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:05:23,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-14 03:05:23,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:23,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2024-11-14 03:05:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:05:23,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:05:23,892 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2308) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-14 03:05:23,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2308) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-14 03:05:23,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2307 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2307))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2308)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (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_2307 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2307)))) is different from false [2024-11-14 03:05:23,960 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2307 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_207| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_207|) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_207| (select v_ArrVal_2307 |v_ULTIMATE.start_sll_update_at_~head#1.offset_207|)) v_ArrVal_2307)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2307) (select v_ArrVal_2307 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2308) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2024-11-14 03:05:23,977 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2307 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_207| Int)) (or (not (= v_ArrVal_2307 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_207| (select v_ArrVal_2307 |v_ULTIMATE.start_sll_update_at_~head#1.offset_207|)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2307) (select v_ArrVal_2307 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_207|))) is different from false [2024-11-14 03:05:23,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-14 03:05:23,991 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:05:23,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-14 03:05:24,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:24,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2024-11-14 03:05:24,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 03:05:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-11-14 03:05:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675676179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:05:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065507060] [2024-11-14 03:05:24,147 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:05:24,147 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:05:24,147 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:05:24,147 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:05:24,148 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:05:25,171 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:05:44,549 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7162#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 03:05:44,549 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:05:44,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:05:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 38 [2024-11-14 03:05:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226021094] [2024-11-14 03:05:44,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:05:44,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 03:05:44,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:05:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 03:05:44,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2106, Unknown=18, NotChecked=480, Total=2756 [2024-11-14 03:05:44,551 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:05:47,025 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-14 03:05:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:05:47,026 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 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 39 [2024-11-14 03:05:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:05:47,026 INFO L225 Difference]: With dead ends: 55 [2024-11-14 03:05:47,026 INFO L226 Difference]: Without dead ends: 55 [2024-11-14 03:05:47,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=349, Invalid=4075, Unknown=18, NotChecked=670, Total=5112 [2024-11-14 03:05:47,027 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 74 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:05:47,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 100 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 794 Invalid, 0 Unknown, 254 Unchecked, 0.9s Time] [2024-11-14 03:05:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-14 03:05:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-14 03:05:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-14 03:05:47,030 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 39 [2024-11-14 03:05:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:47,030 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-14 03:05:47,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-11-14 03:05:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:05:47,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:47,031 INFO L215 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] [2024-11-14 03:05:47,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 03:05:47,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:05:47,232 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:05:47,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash 229765935, now seen corresponding path program 1 times [2024-11-14 03:05:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:47,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775520127] [2024-11-14 03:05:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:47,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:05:48,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775520127] [2024-11-14 03:05:48,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775520127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:05:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56833599] [2024-11-14 03:05:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:48,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:05:48,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:05:48,484 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:05:48,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 03:05:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:48,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 03:05:48,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:05:48,913 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:05:48,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:05:49,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:05:49,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:49,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 03:05:49,505 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:05:49,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 03:05:49,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:49,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-14 03:05:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:05:49,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:05:50,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2417 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2417) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-14 03:05:50,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2417 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2417) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-14 03:05:50,266 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2417 (Array Int Int)) (v_ArrVal_2416 (Array Int Int))) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2416))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2417)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= v_ArrVal_2416 (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_2416 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2024-11-14 03:05:50,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2417 (Array Int Int)) (v_ArrVal_2416 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_222| Int)) (or (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_222| (select v_ArrVal_2416 |v_ULTIMATE.start_sll_update_at_~head#1.offset_222|)) v_ArrVal_2416)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_222|) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2416) (select v_ArrVal_2416 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2417) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-14 03:05:50,319 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2417 (Array Int Int)) (v_ArrVal_2416 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_222| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_222|) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_222| (select v_ArrVal_2416 |v_ULTIMATE.start_sll_update_at_~head#1.offset_222|)) v_ArrVal_2416)) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2416) (select v_ArrVal_2416 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2417) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-14 03:05:50,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-14 03:05:50,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:05:50,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:50,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-14 03:05:50,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:50,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2024-11-14 03:05:50,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 03:05:50,498 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:05:50,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-14 03:05:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-11-14 03:05:50,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56833599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:05:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [733429595] [2024-11-14 03:05:50,542 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:05:50,542 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:05:50,542 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:05:50,543 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:05:50,543 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:05:51,701 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:06:14,903 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7603#(exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_44| Int)) (and (<= |#StackHeapBarrier| |v_ULTIMATE.start_sll_destroy_~head#1.base_44|) (= (select |#valid| |v_ULTIMATE.start_sll_destroy_~head#1.base_44|) 1) (<= 8 (select |#length| |v_ULTIMATE.start_sll_destroy_~head#1.base_44|)) (not (= |v_ULTIMATE.start_sll_destroy_~head#1.base_44| 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_destroy_~head#1.base_44|) 4) |ULTIMATE.start_sll_destroy_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_destroy_~head#1.base_44|) 4) |ULTIMATE.start_sll_destroy_~temp~1#1.base|)))' at error location [2024-11-14 03:06:14,903 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:06:14,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:06:14,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 38 [2024-11-14 03:06:14,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092129204] [2024-11-14 03:06:14,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:06:14,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 03:06:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:06:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 03:06:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2182, Unknown=23, NotChecked=490, Total=2862 [2024-11-14 03:06:14,905 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:06:17,331 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2024-11-14 03:06:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 03:06:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 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 [2024-11-14 03:06:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:06:17,332 INFO L225 Difference]: With dead ends: 56 [2024-11-14 03:06:17,332 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 03:06:17,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=313, Invalid=3716, Unknown=23, NotChecked=640, Total=4692 [2024-11-14 03:06:17,333 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:06:17,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 811 Invalid, 0 Unknown, 222 Unchecked, 1.0s Time] [2024-11-14 03:06:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 03:06:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-14 03:06:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-14 03:06:17,335 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 41 [2024-11-14 03:06:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:06:17,336 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-14 03:06:17,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-14 03:06:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 03:06:17,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:06:17,336 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:06:17,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 03:06:17,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:06:17,537 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:06:17,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:06:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1220747634, now seen corresponding path program 2 times [2024-11-14 03:06:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:06:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634116498] [2024-11-14 03:06:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:06:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:06:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:06:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:06:19,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:06:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634116498] [2024-11-14 03:06:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634116498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:06:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061330064] [2024-11-14 03:06:19,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:06:19,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:06:19,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:06:19,336 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:06:19,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 03:06:19,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:06:19,663 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:06:19,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-14 03:06:19,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:06:19,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:06:19,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:06:19,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:06:19,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:06:19,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:06:19,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:06:19,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:06:19,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:06:20,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 03:06:20,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 03:06:20,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:06:20,440 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-14 03:06:20,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 34 [2024-11-14 03:06:20,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:06:20,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-14 03:06:20,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:06:20,744 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-14 03:06:20,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 60 [2024-11-14 03:06:20,770 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2024-11-14 03:06:20,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2024-11-14 03:06:21,572 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-14 03:06:21,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2024-11-14 03:06:21,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:21,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-14 03:06:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 03:06:21,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:06:46,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_239| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_239|) (forall ((v_ArrVal_2534 (Array Int Int))) (or (not (= v_ArrVal_2534 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_239| (select v_ArrVal_2534 |v_ULTIMATE.start_sll_update_at_~head#1.offset_239|)))) (forall ((v_ArrVal_2535 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_239| (select v_ArrVal_2535 |v_ULTIMATE.start_sll_update_at_~head#1.offset_239|)) v_ArrVal_2535)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_237| Int)) (or (forall ((v_ArrVal_2536 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2534)) (.cse2 (select v_ArrVal_2535 4))) (or (not (= (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2536 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)) v_ArrVal_2536)) (forall ((v_ArrVal_2537 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2535))) (or (= (select (select (store .cse1 .cse2 v_ArrVal_2536) (select (select (store .cse3 .cse2 v_ArrVal_2537) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2537 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)) v_ArrVal_2537)))))))) (< (select v_ArrVal_2534 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_237| Int) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_239| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2535)) (.cse6 (select v_ArrVal_2535 4))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_239| (select v_ArrVal_2535 |v_ULTIMATE.start_sll_update_at_~head#1.offset_239|)) v_ArrVal_2535)) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_239|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|) (= (select (let ((.cse4 (store .cse5 .cse6 v_ArrVal_2537))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2537 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)) v_ArrVal_2537))))))) is different from false [2024-11-14 03:06:46,070 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:06:46,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:46,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-14 03:06:46,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:06:46,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:46,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-14 03:06:46,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:06:46,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:46,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-14 03:06:46,302 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_237| Int) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2535)) (.cse2 (select v_ArrVal_2535 4))) (or (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_2537))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|) (not (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= v_ArrVal_2537 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2537 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_237| Int) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2534)) (.cse6 (select v_ArrVal_2534 4)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2535)) (.cse4 (select v_ArrVal_2535 4))) (or (= (select (select (store .cse3 .cse4 v_ArrVal_2536) (select (select (store .cse5 .cse4 v_ArrVal_2537) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= v_ArrVal_2536 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2536 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)))) (not (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|) (not (= v_ArrVal_2537 (store (select .cse5 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2537 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)))))))) is different from false [2024-11-14 03:06:47,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:47,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 204 [2024-11-14 03:06:47,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:47,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 154 [2024-11-14 03:06:47,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:47,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 322 [2024-11-14 03:06:47,710 INFO L349 Elim1Store]: treesize reduction 22, result has 67.2 percent of original size [2024-11-14 03:06:47,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 499 treesize of output 525 [2024-11-14 03:06:47,876 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-14 03:06:47,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 408 treesize of output 380 [2024-11-14 03:06:48,051 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-14 03:06:48,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 305 [2024-11-14 03:06:48,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:48,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 310 [2024-11-14 03:06:48,403 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-14 03:06:48,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 304 treesize of output 292 [2024-11-14 03:06:49,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 03:06:49,900 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-14 03:06:49,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 99 [2024-11-14 03:06:50,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:50,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2024-11-14 03:06:50,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:50,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 91 [2024-11-14 03:06:50,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:50,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2024-11-14 03:06:50,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:50,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2024-11-14 03:06:51,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:51,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 90 [2024-11-14 03:06:51,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:51,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-14 03:06:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 4 not checked. [2024-11-14 03:06:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061330064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:06:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2106247851] [2024-11-14 03:06:51,740 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:06:51,740 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:06:51,740 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:06:51,740 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:06:51,740 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:06:53,094 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:07:32,169 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8064#(exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_51| Int)) (and (or (not (= |v_ULTIMATE.start_sll_destroy_~head#1.base_51| 0)) (not (= |ULTIMATE.start_sll_destroy_~head#1.offset| 0))) (not (= (select |#valid| |v_ULTIMATE.start_sll_destroy_~head#1.base_51|) 1))))' at error location [2024-11-14 03:07:32,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:07:32,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:07:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2024-11-14 03:07:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958469966] [2024-11-14 03:07:32,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:07:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-14 03:07:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-14 03:07:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3208, Unknown=24, NotChecked=230, Total=3660 [2024-11-14 03:07:32,171 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:36,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse5 (select .cse2 .cse13)) (.cse0 (select .cse12 4)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse4 (select .cse12 .cse13))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) (= (select .cse1 4) 0) (= (select .cse2 4) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse0) 4)) .cse3 (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse4) (<= .cse5 0) (= (select .cse6 4) 0) (<= |c_ULTIMATE.start_sll_update_at_~head#1.offset| .cse5) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse0) (or (let ((.cse11 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse10 (select .cse1 .cse11))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse10)) (.cse7 (select .cse6 .cse11))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_237| Int)) (or (< .cse7 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|) (forall ((v_ArrVal_2537 (Array Int Int))) (or (not (= v_ArrVal_2537 (store .cse8 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2537 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)))) (= (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_2537))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_237| Int)) (or (forall ((v_ArrVal_2536 (Array Int Int))) (or (not (= v_ArrVal_2536 (store (select |c_#memory_$Pointer$.offset| .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2536 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)))) (forall ((v_ArrVal_2537 (Array Int Int))) (or (not (= v_ArrVal_2537 (store .cse8 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237| (select v_ArrVal_2537 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_2536) (select (select (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_2537) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0))))) (< .cse7 |v_ULTIMATE.start_sll_update_at_~head#1.offset_237|))))))) (not .cse3)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)))) is different from false [2024-11-14 03:07:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:41,459 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-11-14 03:07:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:07:41,460 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 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 44 [2024-11-14 03:07:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:41,460 INFO L225 Difference]: With dead ends: 90 [2024-11-14 03:07:41,460 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 03:07:41,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 69.4s TimeCoverageRelationStatistics Valid=271, Invalid=4272, Unknown=25, NotChecked=402, Total=4970 [2024-11-14 03:07:41,461 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:41,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 238 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 778 Invalid, 0 Unknown, 152 Unchecked, 4.3s Time] [2024-11-14 03:07:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 03:07:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-11-14 03:07:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 87 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2024-11-14 03:07:41,463 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 44 [2024-11-14 03:07:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:41,464 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2024-11-14 03:07:41,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2024-11-14 03:07:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 03:07:41,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:41,464 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-14 03:07:41,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 03:07:41,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:07:41,665 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:07:41,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1220746214, now seen corresponding path program 2 times [2024-11-14 03:07:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:41,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888566777] [2024-11-14 03:07:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:07:47,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888566777] [2024-11-14 03:07:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888566777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:07:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031078873] [2024-11-14 03:07:47,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:07:47,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:07:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:07:47,138 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:07:47,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 03:07:47,494 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:07:47,494 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:07:47,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:07:47,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:07:48,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:07:49,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:07:49,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-11-14 03:07:50,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:07:50,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2024-11-14 03:07:51,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2024-11-14 03:07:52,343 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_52| Int) (|v_ULTIMATE.start_sll_destroy_~head#1.base_53| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_52| 0) |v_ULTIMATE.start_sll_destroy_~head#1.base_53| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_53|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_53| 1) |v_ULTIMATE.start_sll_destroy_~head#1.base_52|) 0))) is different from true [2024-11-14 03:07:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-11-14 03:07:52,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:07:56,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2024-11-14 03:07:56,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2024-11-14 03:07:56,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:08:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 19 refuted. 2 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:08:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031078873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:08:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [719460711] [2024-11-14 03:08:09,743 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:08:09,743 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:08:09,743 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:08:09,743 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:08:09,744 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:08:11,027 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:08:18,449 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 192 DAG size of output: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:08:44,893 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8591#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 03:08:44,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:08:44,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:08:44,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 18] total 55 [2024-11-14 03:08:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278838793] [2024-11-14 03:08:44,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:08:44,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-14 03:08:44,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:44,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-14 03:08:44,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=4717, Unknown=26, NotChecked=138, Total=5112 [2024-11-14 03:08:44,896 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 57 states, 56 states have (on average 2.125) internal successors, (119), 56 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:00,127 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2024-11-14 03:09:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 03:09:00,128 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.125) internal successors, (119), 56 states have internal predecessors, (119), 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 44 [2024-11-14 03:09:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:00,129 INFO L225 Difference]: With dead ends: 89 [2024-11-14 03:09:00,129 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 03:09:00,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=418, Invalid=7750, Unknown=26, NotChecked=178, Total=8372 [2024-11-14 03:09:00,130 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:00,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 201 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1536 Invalid, 0 Unknown, 72 Unchecked, 8.1s Time] [2024-11-14 03:09:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 03:09:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-14 03:09:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 56 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) [2024-11-14 03:09:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-14 03:09:00,132 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 44 [2024-11-14 03:09:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:00,133 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-14 03:09:00,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.125) internal successors, (119), 56 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-14 03:09:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 03:09:00,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:00,133 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:00,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 03:09:00,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-14 03:09:00,334 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-14 03:09:00,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:00,334 INFO L85 PathProgramCache]: Analyzing trace with hash 277244077, now seen corresponding path program 3 times [2024-11-14 03:09:00,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:09:00,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927393269] [2024-11-14 03:09:00,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:00,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:09:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:09:00,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:09:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927393269] [2024-11-14 03:09:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927393269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:09:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288005250] [2024-11-14 03:09:00,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:09:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:09:00,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:00,642 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:09:00,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 03:09:00,986 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:09:00,986 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:09:00,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-14 03:09:00,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:01,218 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 03:09:01,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 03:09:01,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:09:01,971 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-14 03:09:01,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-14 03:09:02,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-14 03:09:02,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-14 03:09:02,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:09:02,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2024-11-14 03:09:03,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:09:03,239 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:09:03,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2024-11-14 03:09:03,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:09:03,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:09:03,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:09:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:09:03,853 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:09:03,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 47 [2024-11-14 03:09:05,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:09:05,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-14 03:09:05,408 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-14 03:09:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2024-11-14 03:09:05,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-11-14 03:09:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:09:06,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:09:07,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (or (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2810))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2811) .cse0 v_ArrVal_2812) (select (select .cse1 .cse0) 4)))) 1) (not (= v_ArrVal_2810 (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_2810 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2024-11-14 03:09:07,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|) (= (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2810))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2811) .cse1 v_ArrVal_2812) (select (select .cse2 .cse1) 4)))) 1) (not (= v_ArrVal_2810 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|)))))))) is different from false [2024-11-14 03:09:07,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (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))) (or (not (= v_ArrVal_2810 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|)))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2810))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2811) .cse2 v_ArrVal_2812) (select (select .cse3 .cse2) 4)))) 1))))) is different from false [2024-11-14 03:09:07,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2808)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (or (not (= (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2809 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2809)) (= (let ((.cse1 (store .cse2 .cse3 v_ArrVal_2810))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2811) .cse0 v_ArrVal_2812) (select (select .cse1 .cse0) 4)))) 1) (not (= (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|)) v_ArrVal_2810)) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2809) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|) (not (= v_ArrVal_2808 (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_2808 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-14 03:09:08,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_271| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2808)) (.cse1 (select v_ArrVal_2808 .cse2))) (or (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|)) v_ArrVal_2810)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_271|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_271| (select v_ArrVal_2808 |v_ULTIMATE.start_sll_update_at_~head#1.offset_271|)) v_ArrVal_2808)) (= (let ((.cse4 (store .cse0 .cse1 v_ArrVal_2810))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2811) .cse3 v_ArrVal_2812) (select (select .cse4 .cse3) 4)))) 1))))) is different from false [2024-11-14 03:09:08,215 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_271| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2808)) (.cse3 (select v_ArrVal_2808 .cse4))) (or (= (let ((.cse1 (store .cse2 .cse3 v_ArrVal_2810))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2811) .cse0 v_ArrVal_2812) (select (select .cse1 .cse0) 4)))) 1) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_271|) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_271| (select v_ArrVal_2808 |v_ULTIMATE.start_sll_update_at_~head#1.offset_271|)) v_ArrVal_2808)) (not (= v_ArrVal_2810 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|)))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|))))) is different from false [2024-11-14 03:09:08,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_271| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2808)) (.cse1 (select v_ArrVal_2808 .cse4))) (or (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|)) v_ArrVal_2810)) (= (let ((.cse3 (store .cse0 .cse1 v_ArrVal_2810))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2811) .cse2 v_ArrVal_2812) (select (select .cse3 .cse2) 4)))) 1) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_271|) (not (= (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_271| (select v_ArrVal_2808 |v_ULTIMATE.start_sll_update_at_~head#1.offset_271|)) v_ArrVal_2808)))))) is different from false [2024-11-14 03:09:08,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:08,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:08,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-14 03:09:08,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2808)) (.cse3 (select v_ArrVal_2808 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (or (= 1 (let ((.cse1 (store .cse2 .cse3 v_ArrVal_2810))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (select (store (store |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2811) .cse0 v_ArrVal_2812) (select (select .cse1 .cse0) 4))))) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|) (not (= v_ArrVal_2810 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|))))))) is different from false [2024-11-14 03:09:08,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_269| Int) (v_ArrVal_2810 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_134| Int) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2812 Int) (v_ArrVal_2811 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_134| v_ArrVal_2808)) (.cse3 (select v_ArrVal_2808 4))) (or (= (let ((.cse1 (store .cse2 .cse3 v_ArrVal_2810))) (let ((.cse0 (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_134|) 4))) (select (store (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_134| v_ArrVal_2811) .cse0 v_ArrVal_2812) (select (select .cse1 .cse0) 4)))) 1) (not (= (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_269| (select v_ArrVal_2810 |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|)) v_ArrVal_2810)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_269|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_134|) 0)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse3))))) is different from false [2024-11-14 03:09:08,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:08,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 74 [2024-11-14 03:09:08,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:08,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2024-11-14 03:09:08,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-14 03:09:08,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:08,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 86 [2024-11-14 03:09:10,897 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2024-11-14 03:09:10,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 169 treesize of output 1 [2024-11-14 03:09:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 14 not checked. [2024-11-14 03:09:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288005250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:09:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1209463388] [2024-11-14 03:09:10,900 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:09:10,901 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:09:10,901 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:09:10,901 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:09:10,901 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:09:12,033 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:09:57,164 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9123#(exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_66| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_destroy_~head#1.base_66|) 1)) (or (not (= |v_ULTIMATE.start_sll_destroy_~head#1.base_66| 0)) (not (= |ULTIMATE.start_sll_destroy_~head#1.offset| 0)))))' at error location [2024-11-14 03:09:57,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:09:57,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:09:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 20, 21] total 43 [2024-11-14 03:09:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883512271] [2024-11-14 03:09:57,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:09:57,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 03:09:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:09:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 03:09:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2103, Unknown=17, NotChecked=900, Total=3192 [2024-11-14 03:09:57,169 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 43 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 43 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:58,881 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2024-11-14 03:09:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:09:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 43 states have internal predecessors, (119), 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 49 [2024-11-14 03:09:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:58,882 INFO L225 Difference]: With dead ends: 12 [2024-11-14 03:09:58,882 INFO L226 Difference]: Without dead ends: 0 [2024-11-14 03:09:58,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=201, Invalid=2470, Unknown=17, NotChecked=972, Total=3660 [2024-11-14 03:09:58,883 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:58,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 98 Unchecked, 0.8s Time] [2024-11-14 03:09:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-14 03:09:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-14 03:09:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-14 03:09:58,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-11-14 03:09:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:58,885 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-14 03:09:58,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.7674418604651163) internal successors, (119), 43 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-14 03:09:58,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-14 03:09:58,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-14 03:09:58,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-14 03:09:58,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-14 03:09:58,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-14 03:09:58,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-14 03:09:58,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-14 03:09:58,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-14 03:09:58,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-14 03:09:58,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-14 03:09:58,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-14 03:09:58,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-14 03:09:58,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-14 03:09:58,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-14 03:09:58,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-14 03:09:58,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-14 03:09:58,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-14 03:09:58,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-14 03:09:58,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-14 03:09:58,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-14 03:09:58,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2024-11-14 03:09:58,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-14 03:09:58,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 03:09:59,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-14 03:09:59,101 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:59,103 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:09:59,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:09:59 BoogieIcfgContainer [2024-11-14 03:09:59,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:09:59,108 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:09:59,108 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:09:59,108 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:09:59,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:59:43" (3/4) ... [2024-11-14 03:09:59,111 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-14 03:09:59,118 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-14 03:09:59,118 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-14 03:09:59,119 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-14 03:09:59,119 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-14 03:09:59,201 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 03:09:59,201 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/witness.yml [2024-11-14 03:09:59,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:09:59,202 INFO L158 Benchmark]: Toolchain (without parser) took 617406.44ms. Allocated memory was 117.4MB in the beginning and 729.8MB in the end (delta: 612.4MB). Free memory was 93.6MB in the beginning and 533.8MB in the end (delta: -440.2MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2024-11-14 03:09:59,202 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 167.8MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:09:59,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.99ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 76.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:09:59,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.67ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:09:59,203 INFO L158 Benchmark]: Boogie Preprocessor took 29.13ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:09:59,203 INFO L158 Benchmark]: RCFGBuilder took 662.18ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 50.2MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:09:59,203 INFO L158 Benchmark]: TraceAbstraction took 616018.13ms. Allocated memory was 117.4MB in the beginning and 729.8MB in the end (delta: 612.4MB). Free memory was 49.9MB in the beginning and 539.6MB in the end (delta: -489.7MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2024-11-14 03:09:59,203 INFO L158 Benchmark]: Witness Printer took 93.27ms. Allocated memory is still 729.8MB. Free memory was 539.6MB in the beginning and 533.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:09:59,204 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.45ms. Allocated memory is still 167.8MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.99ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 76.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.67ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.13ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 662.18ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 50.2MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 616018.13ms. Allocated memory was 117.4MB in the beginning and 729.8MB in the end (delta: 612.4MB). Free memory was 49.9MB in the beginning and 539.6MB in the end (delta: -489.7MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. * Witness Printer took 93.27ms. Allocated memory is still 729.8MB. Free memory was 539.6MB in the beginning and 533.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 616.0s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 78.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1211 SdHoareTripleChecker+Valid, 41.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1211 mSDsluCounter, 4721 SdHoareTripleChecker+Invalid, 39.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1509 IncrementalHoareTripleChecker+Unchecked, 4054 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13640 IncrementalHoareTripleChecker+Invalid, 15352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 667 mSDtfsCounter, 13640 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2445 GetRequests, 1335 SyntacticMatches, 73 SemanticMatches, 1037 ConstructedPredicates, 37 IntricatePredicates, 2 DeprecatedPredicates, 12985 ImplicationChecksByTransitivity, 495.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=35, InterpolantAutomatonStates: 394, 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, 37 MinimizatonAttempts, 170 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 109.8s InterpolantComputationTime, 1623 NumberOfCodeBlocks, 1619 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2166 ConstructedInterpolants, 158 QuantifiedInterpolants, 31237 SizeOfPredicates, 97 NumberOfNonLiveVariables, 7108 ConjunctsInSsa, 897 ConjunctsInUnsatCore, 79 InterpolantComputations, 17 PerfectInterpolantSequences, 879/1424 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: OVERALL_TIME: 4.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 84, TOOLS_POST_TIME: 1.7s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 83, TOOLS_QUANTIFIERELIM_TIME: 1.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 154, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 9, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 18, DOMAIN_ISSUBSETEQ_TIME: 2.6s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 9, LOOP_SUMMARIZER_CACHE_MISSES: 9, LOOP_SUMMARIZER_OVERALL_TIME: 3.7s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.7s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 18, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 410, DAG_COMPRESSION_RETAINED_NODES: 105, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-14 03:09:59,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42fe102d-d2f4-4e04-bffe-b7093aafcb55/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE