./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_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_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/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_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/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_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:51:38,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:51:38,174 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:51:38,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:51:38,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:51:38,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:51:38,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:51:38,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:51:38,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:51:38,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:51:38,229 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:51:38,229 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:51:38,229 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:51:38,229 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:51:38,230 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:51:38,230 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:51:38,230 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:51:38,230 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:51:38,230 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:51:38,231 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:51:38,231 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:51:38,231 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:51:38,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:51:38,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:51:38,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:51:38,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:51:38,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:51:38,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:51:38,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:51:38,233 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:51:38,233 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:51:38,234 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:51:38,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:51:38,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:51:38,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:51:38,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:51:38,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:51:38,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:51:38,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:51:38,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:51:38,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:51:38,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:51:38,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:51:38,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:51:38,236 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:51:38,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:51:38,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:51:38,236 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:51:38,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:51:38,236 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_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2024-11-14 03:51:38,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:51:38,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:51:38,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:51:38,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:51:38,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:51:38,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2c_remove_all.i Unable to find full path for "g++" [2024-11-14 03:51:40,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:51:40,817 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:51:40,818 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-14 03:51:40,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data/fdb2e81b4/d5f26ce0ecda46e3a2e69f33115751cc/FLAG673103f65 [2024-11-14 03:51:40,852 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data/fdb2e81b4/d5f26ce0ecda46e3a2e69f33115751cc [2024-11-14 03:51:40,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:51:40,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:51:40,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:51:40,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:51:40,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:51:40,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:51:40" (1/1) ... [2024-11-14 03:51:40,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2738d207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:40, skipping insertion in model container [2024-11-14 03:51:40,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:51:40" (1/1) ... [2024-11-14 03:51:40,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:51:41,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:51:41,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:51:41,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:51:41,329 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:51:41,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41 WrapperNode [2024-11-14 03:51:41,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:51:41,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:51:41,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:51:41,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:51:41,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,373 INFO L138 Inliner]: procedures = 126, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 112 [2024-11-14 03:51:41,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:51:41,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:51:41,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:51:41,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:51:41,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:51:41,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:51:41,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:51:41,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:51:41,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (1/1) ... [2024-11-14 03:51:41,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:51:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:51:41,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:51:41,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 03:51:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:51:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:51:41,616 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:51:41,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:51:42,024 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-14 03:51:42,024 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:51:42,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:51:42,079 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 03:51:42,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:51:42 BoogieIcfgContainer [2024-11-14 03:51:42,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:51:42,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:51:42,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:51:42,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:51:42,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:51:40" (1/3) ... [2024-11-14 03:51:42,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129c1550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:51:42, skipping insertion in model container [2024-11-14 03:51:42,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:51:41" (2/3) ... [2024-11-14 03:51:42,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129c1550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:51:42, skipping insertion in model container [2024-11-14 03:51:42,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:51:42" (3/3) ... [2024-11-14 03:51:42,092 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2024-11-14 03:51:42,114 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:51:42,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all.i that has 2 procedures, 92 locations, 1 initial locations, 2 loop locations, and 46 error locations. [2024-11-14 03:51:42,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:51:42,184 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;@6fc766be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:51:42,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-14 03:51:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 42 states have (on average 2.261904761904762) internal successors, (95), 88 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:51:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:51:42,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:51:42,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:51:42,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:51:42,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:51:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash 178189099, now seen corresponding path program 1 times [2024-11-14 03:51:42,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:51:42,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244926092] [2024-11-14 03:51:42,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:51:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:51:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:51:42,533 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 03:51:42,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:51:42,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244926092] [2024-11-14 03:51:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244926092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:51:42,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:51:42,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:51:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729949853] [2024-11-14 03:51:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:51:42,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:51:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:51:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:51:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:51:42,573 INFO L87 Difference]: Start difference. First operand has 92 states, 42 states have (on average 2.261904761904762) internal successors, (95), 88 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:51:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:51:42,735 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-14 03:51:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:51:42,738 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 03:51:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:51:42,744 INFO L225 Difference]: With dead ends: 88 [2024-11-14 03:51:42,745 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 03:51:42,749 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 03:51:42,753 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:51:42,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:51:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 03:51:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-14 03:51:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 40 states have (on average 2.15) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:51:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-14 03:51:42,799 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 5 [2024-11-14 03:51:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:51:42,800 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-14 03:51:42,800 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:51:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-14 03:51:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:51:42,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:51:42,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:51:42,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:51:42,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:51:42,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:51:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 178189100, now seen corresponding path program 1 times [2024-11-14 03:51:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:51:42,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607117397] [2024-11-14 03:51:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:51:42,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:51:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:51:42,971 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 03:51:42,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:51:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607117397] [2024-11-14 03:51:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607117397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:51:42,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:51:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:51:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075714379] [2024-11-14 03:51:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:51:42,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:51:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:51:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:51:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:51:42,974 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:51:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:51:43,081 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-14 03:51:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:51:43,081 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 03:51:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:51:43,082 INFO L225 Difference]: With dead ends: 83 [2024-11-14 03:51:43,082 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 03:51:43,082 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 03:51:43,083 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:51:43,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:51:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 03:51:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 03:51:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 40 states have (on average 2.075) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:51:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-14 03:51:43,090 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 5 [2024-11-14 03:51:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:51:43,090 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-14 03:51:43,091 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:51:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-14 03:51:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:51:43,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:51:43,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:51:43,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:51:43,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:51:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:51:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1278743786, now seen corresponding path program 1 times [2024-11-14 03:51:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:51:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418544952] [2024-11-14 03:51:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:51:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:51:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:51:43,190 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 03:51:43,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:51:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418544952] [2024-11-14 03:51:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418544952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:51:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:51:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:51:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709734281] [2024-11-14 03:51:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:51:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:51:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:51:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:51:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:51:43,192 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:51:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:51:43,246 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-14 03:51:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:51:43,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-14 03:51:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:51:43,248 INFO L225 Difference]: With dead ends: 84 [2024-11-14 03:51:43,248 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 03:51:43,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:51:43,249 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:51:43,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:51:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 03:51:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 03:51:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 2.048780487804878) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:51:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-14 03:51:43,256 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 11 [2024-11-14 03:51:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:51:43,257 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-14 03:51:43,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:51:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-14 03:51:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:51:43,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:51:43,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:51:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:51:43,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:51:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:51:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2091942470, now seen corresponding path program 1 times [2024-11-14 03:51:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:51:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457263511] [2024-11-14 03:51:43,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:51:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:51:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:51:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:51:43,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:51:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457263511] [2024-11-14 03:51:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457263511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:51:43,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:51:43,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:51:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857101704] [2024-11-14 03:51:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:51:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:51:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:51:43,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:51:43,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:51:43,577 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:51:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:51:43,813 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-14 03:51:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:51:43,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 03:51:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:51:43,814 INFO L225 Difference]: With dead ends: 83 [2024-11-14 03:51:43,815 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 03:51:43,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:51:43,815 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:51:43,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 205 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:51:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 03:51:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 03:51:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 41 states have (on average 2.024390243902439) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:51:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-14 03:51:43,822 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 19 [2024-11-14 03:51:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:51:43,822 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-14 03:51:43,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:51:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-14 03:51:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:51:43,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:51:43,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:51:43,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:51:43,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:51:43,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:51:43,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2091942469, now seen corresponding path program 1 times [2024-11-14 03:51:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:51:43,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401945825] [2024-11-14 03:51:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:51:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:51:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:51:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:51:44,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:51:44,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401945825] [2024-11-14 03:51:44,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401945825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:51:44,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:51:44,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:51:44,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500381903] [2024-11-14 03:51:44,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:51:44,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:51:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:51:44,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:51:44,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:51:44,210 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:51:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:51:44,412 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-11-14 03:51:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:51:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 03:51:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:51:44,414 INFO L225 Difference]: With dead ends: 82 [2024-11-14 03:51:44,414 INFO L226 Difference]: Without dead ends: 82 [2024-11-14 03:51:44,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:51:44,415 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:51:44,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 255 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:51:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-14 03:51:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-14 03:51:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.0) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:51:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-11-14 03:51:44,426 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 19 [2024-11-14 03:51:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:51:44,426 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-11-14 03:51:44,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:51:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-11-14 03:51:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:51:44,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:51:44,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:51:44,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:51:44,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:51:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:51:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash -312019461, now seen corresponding path program 1 times [2024-11-14 03:51:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:51:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873175740] [2024-11-14 03:51:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:51:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:51:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:51:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:51:44,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:51:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873175740] [2024-11-14 03:51:44,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873175740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:51:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381803759] [2024-11-14 03:51:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:51:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:51:44,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:51:44,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:51:44,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:51:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:51:44,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:51:45,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:51:45,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:51:45,120 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-14 03:51:45,173 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:51:45,173 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 12 treesize of output 14 [2024-11-14 03:51:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:51:45,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:51:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:51:45,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381803759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:51:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840030868] [2024-11-14 03:51:45,495 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:51:45,495 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:51:45,499 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:51:45,503 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:51:45,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:51:47,019 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:51:47,869 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:52:02,137 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1086#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 1)) (exists ((|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_78| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_int_68| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:52:02,137 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:52:02,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:52:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-14 03:52:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390431163] [2024-11-14 03:52:02,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:52:02,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:52:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:52:02,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:52:02,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=470, Unknown=3, NotChecked=44, Total=600 [2024-11-14 03:52:02,140 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 03:52:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:52:02,923 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-11-14 03:52:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:52:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-14 03:52:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:52:02,925 INFO L225 Difference]: With dead ends: 87 [2024-11-14 03:52:02,925 INFO L226 Difference]: Without dead ends: 87 [2024-11-14 03:52:02,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=89, Invalid=512, Unknown=3, NotChecked=46, Total=650 [2024-11-14 03:52:02,926 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:52:02,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 373 Invalid, 0 Unknown, 89 Unchecked, 0.7s Time] [2024-11-14 03:52:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-14 03:52:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-14 03:52:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:52:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-14 03:52:02,932 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 21 [2024-11-14 03:52:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:52:02,933 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-14 03:52:02,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 03:52:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-14 03:52:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:52:02,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:52:02,933 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:52:02,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:52:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:52:03,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:52:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:52:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -312019460, now seen corresponding path program 1 times [2024-11-14 03:52:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:52:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695257838] [2024-11-14 03:52:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:52:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:52:03,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:52:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695257838] [2024-11-14 03:52:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695257838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:52:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878054258] [2024-11-14 03:52:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:03,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:52:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:52:03,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:52:03,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:52:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:03,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:52:03,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:52:03,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:52:03,933 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:52:04,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:52:04,309 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:52:04,322 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:52:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:52:04,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:52:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878054258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:52:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545398734] [2024-11-14 03:52:04,679 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:52:04,679 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:52:04,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:52:04,682 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:52:04,682 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:52:05,341 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:52:05,981 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:52:20,908 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1371#(and (exists ((|v_#memory_$Pointer$.offset_92| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_92| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_92| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (exists ((|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_92| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_92| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_82| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_82| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_82| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:52:20,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:52:20,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:52:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-14 03:52:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426063313] [2024-11-14 03:52:20,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:52:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:52:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:52:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:52:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=939, Unknown=2, NotChecked=0, Total=1056 [2024-11-14 03:52:20,911 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:52:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:52:22,471 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-14 03:52:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:52:22,472 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-11-14 03:52:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:52:22,473 INFO L225 Difference]: With dead ends: 87 [2024-11-14 03:52:22,473 INFO L226 Difference]: Without dead ends: 87 [2024-11-14 03:52:22,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=138, Invalid=1120, Unknown=2, NotChecked=0, Total=1260 [2024-11-14 03:52:22,475 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:52:22,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 03:52:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-14 03:52:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-14 03:52:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:52:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-14 03:52:22,481 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 21 [2024-11-14 03:52:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:52:22,481 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-14 03:52:22,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:52:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-14 03:52:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:52:22,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:52:22,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:52:22,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:52:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:52:22,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:52:22,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:52:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash 797167575, now seen corresponding path program 1 times [2024-11-14 03:52:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:52:22,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968071059] [2024-11-14 03:52:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:52:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:52:22,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:52:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968071059] [2024-11-14 03:52:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968071059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:52:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395475874] [2024-11-14 03:52:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:52:22,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:52:22,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:52:22,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:52:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:22,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:52:22,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:52:23,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:52:23,149 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-14 03:52:23,179 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:52:23,179 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 12 treesize of output 14 [2024-11-14 03:52:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-14 03:52:23,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:52:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:52:23,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395475874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:52:23,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [793714768] [2024-11-14 03:52:23,467 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:52:23,467 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:52:23,467 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:52:23,468 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:52:23,468 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:52:23,984 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-14 03:52:24,056 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:52:41,186 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1709#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20|) 1))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:52:41,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:52:41,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:52:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2024-11-14 03:52:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640494070] [2024-11-14 03:52:41,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:52:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:52:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:52:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:52:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=615, Unknown=7, NotChecked=50, Total=756 [2024-11-14 03:52:41,188 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 03:52:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:52:42,063 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-14 03:52:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:52:42,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 23 [2024-11-14 03:52:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:52:42,065 INFO L225 Difference]: With dead ends: 86 [2024-11-14 03:52:42,065 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 03:52:42,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=107, Invalid=820, Unknown=7, NotChecked=58, Total=992 [2024-11-14 03:52:42,066 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:52:42,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 495 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 86 Unchecked, 0.7s Time] [2024-11-14 03:52:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 03:52:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-14 03:52:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:52:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-14 03:52:42,078 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 23 [2024-11-14 03:52:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:52:42,078 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-14 03:52:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 03:52:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-14 03:52:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:52:42,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:52:42,079 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:52:42,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:52:42,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 03:52:42,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:52:42,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:52:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1062532834, now seen corresponding path program 1 times [2024-11-14 03:52:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:52:42,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509847966] [2024-11-14 03:52:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:52:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:52:42,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:52:42,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509847966] [2024-11-14 03:52:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509847966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:52:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346083099] [2024-11-14 03:52:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:52:42,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:52:42,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:52:42,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:52:42,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:52:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:52:42,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:52:42,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:52:42,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:52:42,792 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:52:43,015 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:52:43,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:52:43,055 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:52:43,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:52:43,074 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:52:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:52:43,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:52:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346083099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:52:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [906350955] [2024-11-14 03:52:43,358 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:52:43,358 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:52:43,358 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:52:43,359 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:52:43,359 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:52:44,013 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:52:44,399 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:52:59,809 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2014#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 3)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:52:59,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:52:59,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:52:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-14 03:52:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955509792] [2024-11-14 03:52:59,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:52:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:52:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:52:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:52:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-14 03:52:59,811 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:53:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:00,695 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-11-14 03:53:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:53:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 03:53:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:00,697 INFO L225 Difference]: With dead ends: 103 [2024-11-14 03:53:00,698 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 03:53:00,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-14 03:53:00,699 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:00,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 363 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 309 Invalid, 0 Unknown, 108 Unchecked, 0.6s Time] [2024-11-14 03:53:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 03:53:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2024-11-14 03:53:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-11-14 03:53:00,709 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 24 [2024-11-14 03:53:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-11-14 03:53:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:53:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-11-14 03:53:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:53:00,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:00,710 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:00,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 03:53:00,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:00,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:00,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1421220487, now seen corresponding path program 1 times [2024-11-14 03:53:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:00,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408744513] [2024-11-14 03:53:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:53:01,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:01,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408744513] [2024-11-14 03:53:01,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408744513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:01,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:01,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:01,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218289685] [2024-11-14 03:53:01,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:01,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:01,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:01,145 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:01,816 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-11-14 03:53:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:53:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 03:53:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:01,818 INFO L225 Difference]: With dead ends: 95 [2024-11-14 03:53:01,818 INFO L226 Difference]: Without dead ends: 95 [2024-11-14 03:53:01,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:01,819 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:01,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:53:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-14 03:53:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-14 03:53:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-11-14 03:53:01,825 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 25 [2024-11-14 03:53:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:01,826 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-11-14 03:53:01,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-11-14 03:53:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:53:01,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:01,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:01,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:53:01,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:01,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1421220488, now seen corresponding path program 1 times [2024-11-14 03:53:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80509131] [2024-11-14 03:53:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:02,186 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 03:53:02,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80509131] [2024-11-14 03:53:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80509131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816442014] [2024-11-14 03:53:02,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:02,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:02,188 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:02,635 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-11-14 03:53:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:53:02,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 03:53:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:02,637 INFO L225 Difference]: With dead ends: 94 [2024-11-14 03:53:02,637 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 03:53:02,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:02,638 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:02,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 258 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:53:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 03:53:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-14 03:53:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-11-14 03:53:02,643 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 25 [2024-11-14 03:53:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:02,643 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-11-14 03:53:02,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-11-14 03:53:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:53:02,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:02,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:02,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:53:02,644 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -6590680, now seen corresponding path program 1 times [2024-11-14 03:53:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834519806] [2024-11-14 03:53:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:02,750 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 03:53:02,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834519806] [2024-11-14 03:53:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834519806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:02,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:02,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:53:02,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423740859] [2024-11-14 03:53:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:02,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:53:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:02,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:53:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:53:02,752 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:02,831 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2024-11-14 03:53:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:53:02,832 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-14 03:53:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:02,833 INFO L225 Difference]: With dead ends: 142 [2024-11-14 03:53:02,833 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 03:53:02,833 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 03:53:02,834 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 150 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:02,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 140 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 03:53:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2024-11-14 03:53:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 89 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-11-14 03:53:02,839 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 27 [2024-11-14 03:53:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:02,840 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-11-14 03:53:02,840 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-11-14 03:53:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:53:02,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:02,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:02,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:53:02,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:02,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash -6594334, now seen corresponding path program 1 times [2024-11-14 03:53:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261140525] [2024-11-14 03:53:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:53:03,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:03,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261140525] [2024-11-14 03:53:03,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261140525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:03,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131639968] [2024-11-14 03:53:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:03,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:03,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:03,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:53:03,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:53:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:03,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:53:03,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:03,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:53:03,561 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 5 treesize of output 3 [2024-11-14 03:53:03,576 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-14 03:53:03,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:03,625 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:53:03,648 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 5 treesize of output 3 [2024-11-14 03:53:03,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:03,700 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:53:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:53:03,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:53:03,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131639968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:03,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840101629] [2024-11-14 03:53:03,901 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:53:03,901 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:53:03,901 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:53:03,902 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:53:03,902 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:53:04,606 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:53:05,008 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:53:20,070 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2995#(and (exists ((|v_#memory_$Pointer$.base_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_dll_circular_remove_first_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (exists ((|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_158| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_int_149| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_149| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_149| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_148| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_148| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_149| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_149|))))' at error location [2024-11-14 03:53:20,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:53:20,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:53:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2024-11-14 03:53:20,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972532177] [2024-11-14 03:53:20,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:53:20,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:53:20,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:20,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:53:20,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=879, Unknown=3, NotChecked=60, Total=1056 [2024-11-14 03:53:20,072 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 13 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:53:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:21,006 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2024-11-14 03:53:21,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:53:21,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-14 03:53:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:21,008 INFO L225 Difference]: With dead ends: 126 [2024-11-14 03:53:21,008 INFO L226 Difference]: Without dead ends: 126 [2024-11-14 03:53:21,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=137, Invalid=1054, Unknown=3, NotChecked=66, Total=1260 [2024-11-14 03:53:21,009 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 193 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:21,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 312 Invalid, 0 Unknown, 110 Unchecked, 0.7s Time] [2024-11-14 03:53:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-14 03:53:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2024-11-14 03:53:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 86 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2024-11-14 03:53:21,015 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 27 [2024-11-14 03:53:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:21,016 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2024-11-14 03:53:21,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:53:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2024-11-14 03:53:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:53:21,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:21,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:21,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:53:21,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 03:53:21,218 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:21,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash -6594333, now seen corresponding path program 1 times [2024-11-14 03:53:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:21,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939112290] [2024-11-14 03:53:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:21,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:21,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939112290] [2024-11-14 03:53:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939112290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810116925] [2024-11-14 03:53:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:21,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:53:21,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:53:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:22,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:53:22,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:22,164 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:53:22,250 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 5 treesize of output 3 [2024-11-14 03:53:22,280 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-14 03:53:22,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:22,347 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:53:22,390 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 5 treesize of output 3 [2024-11-14 03:53:22,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:22,462 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:53:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:53:22,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:53:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810116925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [669414073] [2024-11-14 03:53:23,095 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:53:23,095 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:53:23,095 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:53:23,095 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:53:23,096 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:53:23,865 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:53:24,175 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:53:40,493 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3368#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_171| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_171| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_170| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_170| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_171| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_171|))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (exists ((|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (exists ((|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_180| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |#memory_$Pointer$.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 3) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:53:40,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:53:40,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:53:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2024-11-14 03:53:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073448642] [2024-11-14 03:53:40,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:53:40,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 03:53:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:40,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 03:53:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1194, Unknown=3, NotChecked=70, Total=1406 [2024-11-14 03:53:40,495 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:53:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:41,332 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-14 03:53:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:53:41,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-14 03:53:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:41,333 INFO L225 Difference]: With dead ends: 84 [2024-11-14 03:53:41,333 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 03:53:41,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=192, Invalid=1531, Unknown=3, NotChecked=80, Total=1806 [2024-11-14 03:53:41,335 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 176 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:41,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 121 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 65 Unchecked, 0.5s Time] [2024-11-14 03:53:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 03:53:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 03:53:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 78 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-11-14 03:53:41,339 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 27 [2024-11-14 03:53:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:41,339 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-14 03:53:41,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:53:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-11-14 03:53:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:53:41,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:41,340 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:41,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 03:53:41,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:41,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:41,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash -204424333, now seen corresponding path program 1 times [2024-11-14 03:53:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87598014] [2024-11-14 03:53:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:53:41,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87598014] [2024-11-14 03:53:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87598014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:53:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484148464] [2024-11-14 03:53:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:41,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:53:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:53:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:53:41,911 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:42,605 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2024-11-14 03:53:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:53:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-14 03:53:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:42,606 INFO L225 Difference]: With dead ends: 102 [2024-11-14 03:53:42,606 INFO L226 Difference]: Without dead ends: 102 [2024-11-14 03:53:42,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:53:42,609 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 43 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:42,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 235 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:53:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-14 03:53:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2024-11-14 03:53:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 79 states have internal predecessors, (89), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-11-14 03:53:42,614 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 28 [2024-11-14 03:53:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:42,614 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-11-14 03:53:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-11-14 03:53:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:53:42,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:42,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:42,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:53:42,617 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:42,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash -204424332, now seen corresponding path program 1 times [2024-11-14 03:53:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:42,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726803945] [2024-11-14 03:53:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:43,148 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 03:53:43,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726803945] [2024-11-14 03:53:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726803945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:53:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477094839] [2024-11-14 03:53:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:43,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:53:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:43,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:53:43,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:53:43,151 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:43,970 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-14 03:53:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:53:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-14 03:53:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:43,971 INFO L225 Difference]: With dead ends: 103 [2024-11-14 03:53:43,971 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 03:53:43,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:53:43,972 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 43 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:43,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 311 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:53:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 03:53:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2024-11-14 03:53:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.543859649122807) internal successors, (88), 79 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-14 03:53:43,975 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2024-11-14 03:53:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:43,975 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-14 03:53:43,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-14 03:53:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:53:43,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:43,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:43,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:53:43,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:43,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash -482368267, now seen corresponding path program 1 times [2024-11-14 03:53:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839885193] [2024-11-14 03:53:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:44,680 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 03:53:44,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839885193] [2024-11-14 03:53:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839885193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:44,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:44,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 03:53:44,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458748156] [2024-11-14 03:53:44,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:44,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:53:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:53:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:53:44,682 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:45,606 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2024-11-14 03:53:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:53:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-14 03:53:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:45,607 INFO L225 Difference]: With dead ends: 102 [2024-11-14 03:53:45,607 INFO L226 Difference]: Without dead ends: 102 [2024-11-14 03:53:45,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:53:45,607 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:45,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 368 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:53:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-14 03:53:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2024-11-14 03:53:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.540983606557377) internal successors, (94), 83 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2024-11-14 03:53:45,611 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 32 [2024-11-14 03:53:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:45,611 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2024-11-14 03:53:45,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2024-11-14 03:53:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:53:45,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:45,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:45,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:53:45,613 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash -482368268, now seen corresponding path program 1 times [2024-11-14 03:53:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:45,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878565991] [2024-11-14 03:53:45,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:45,752 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 03:53:45,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878565991] [2024-11-14 03:53:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878565991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:45,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:53:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595965025] [2024-11-14 03:53:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:45,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:53:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:53:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:53:45,755 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:46,073 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-14 03:53:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:53:46,073 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-14 03:53:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:46,074 INFO L225 Difference]: With dead ends: 88 [2024-11-14 03:53:46,074 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 03:53:46,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:53:46,074 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:46,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:53:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 03:53:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-14 03:53:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 82 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-11-14 03:53:46,078 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 32 [2024-11-14 03:53:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:46,079 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-11-14 03:53:46,079 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-11-14 03:53:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:53:46,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:46,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:46,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:53:46,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:46,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash -482382171, now seen corresponding path program 1 times [2024-11-14 03:53:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:46,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202644868] [2024-11-14 03:53:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:46,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:46,401 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 03:53:46,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202644868] [2024-11-14 03:53:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202644868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:46,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:46,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:53:46,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500092362] [2024-11-14 03:53:46,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:46,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:53:46,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:53:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:53:46,403 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:47,185 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2024-11-14 03:53:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:53:47,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-14 03:53:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:47,186 INFO L225 Difference]: With dead ends: 112 [2024-11-14 03:53:47,186 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 03:53:47,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:53:47,186 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:47,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 352 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:53:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 03:53:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2024-11-14 03:53:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 93 states have internal predecessors, (111), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:53:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2024-11-14 03:53:47,190 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 32 [2024-11-14 03:53:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:47,190 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-11-14 03:53:47,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2024-11-14 03:53:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:53:47,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:47,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:47,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 03:53:47,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:53:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2068511981, now seen corresponding path program 1 times [2024-11-14 03:53:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856408818] [2024-11-14 03:53:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:48,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856408818] [2024-11-14 03:53:48,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856408818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:48,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365792553] [2024-11-14 03:53:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:48,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:48,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:53:48,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:53:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:48,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 03:53:48,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:48,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:53:49,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:53:49,163 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:53:49,359 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 11 treesize of output 7 [2024-11-14 03:53:49,525 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:53:49,526 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 32 treesize of output 31 [2024-11-14 03:53:49,791 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:53:49,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-14 03:53:49,923 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 36 [2024-11-14 03:53:50,165 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 7 treesize of output 3 [2024-11-14 03:53:50,306 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:53:50,307 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 23 [2024-11-14 03:53:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:50,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:53:50,364 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 46 treesize of output 38 [2024-11-14 03:53:50,515 INFO L349 Elim1Store]: treesize reduction 5, result has 85.7 percent of original size [2024-11-14 03:53:50,515 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 38 [2024-11-14 03:53:50,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1459))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2024-11-14 03:53:50,584 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1459))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2024-11-14 03:53:50,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1459))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2024-11-14 03:53:50,745 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:53:50,745 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 2 case distinctions, treesize of input 2236 treesize of output 1718 [2024-11-14 03:53:51,347 INFO L349 Elim1Store]: treesize reduction 157, result has 55.3 percent of original size [2024-11-14 03:53:51,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 8934 treesize of output 8268 [2024-11-14 03:53:51,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:51,617 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 2737 treesize of output 2621 [2024-11-14 03:53:51,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:51,784 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 2987 treesize of output 2759 [2024-11-14 03:53:52,177 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 6 treesize of output 4 [2024-11-14 03:53:55,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:55,324 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 114 treesize of output 118 [2024-11-14 03:54:01,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:02,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:02,339 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 6 treesize of output 4 [2024-11-14 03:54:03,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:03,809 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 78 treesize of output 82 [2024-11-14 03:54:05,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:05,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:05,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:06,020 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 6 treesize of output 4 [2024-11-14 03:54:06,282 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 6 treesize of output 4 [2024-11-14 03:54:07,182 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 6 treesize of output 4 [2024-11-14 03:54:07,226 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:54:07,617 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 6 treesize of output 4 [2024-11-14 03:54:07,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:08,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:08,721 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 6 treesize of output 4 [2024-11-14 03:54:08,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:54:09,036 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 6 treesize of output 4 [2024-11-14 03:54:09,911 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:54:10,036 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:54:10,492 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:54:10,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 69 treesize of output 65 [2024-11-14 03:54:11,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:11,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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:54:11,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:11,728 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 24 treesize of output 28 [2024-11-14 03:54:12,622 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:54:12,636 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:54:12,714 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:54:12,836 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 6 treesize of output 4 [2024-11-14 03:54:12,897 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 6 treesize of output 4 [2024-11-14 03:54:13,266 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 6 treesize of output 4 [2024-11-14 03:54:15,772 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:54:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365792553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956190247] [2024-11-14 03:54:16,111 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 03:54:16,111 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:54:16,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:54:16,111 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:54:16,111 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:54:16,758 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:54:17,068 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:54:38,413 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4774#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_circular_remove_first_~last~1#1.offset|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0))) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |#valid| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_circular_remove_first_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_$Pointer$.offset_202| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_202| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_202| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_202| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_202| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_circular_remove_first_~last~1#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0)) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_206| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_206| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_206| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_206| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (= |ULTIMATE.start_dll_circular_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_193| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_193| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_192| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_192| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_193| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_193|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 0)) |ULTIMATE.start_dll_circular_remove_first_~temp~1#1.offset|))' at error location [2024-11-14 03:54:38,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:54:38,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:54:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2024-11-14 03:54:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621379836] [2024-11-14 03:54:38,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 03:54:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 03:54:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3318, Unknown=5, NotChecked=354, Total=3906 [2024-11-14 03:54:38,415 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 31 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:54:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:41,123 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-11-14 03:54:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 03:54:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-11-14 03:54:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:41,124 INFO L225 Difference]: With dead ends: 116 [2024-11-14 03:54:41,124 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 03:54:41,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=272, Invalid=4025, Unknown=5, NotChecked=390, Total=4692 [2024-11-14 03:54:41,126 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:41,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 542 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 03:54:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 03:54:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2024-11-14 03:54:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.5) internal successors, (123), 103 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:54:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2024-11-14 03:54:41,131 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 33 [2024-11-14 03:54:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2024-11-14 03:54:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:54:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2024-11-14 03:54:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:54:41,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:41,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:41,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:54:41,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:41,333 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:54:41,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2068511980, now seen corresponding path program 1 times [2024-11-14 03:54:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750022244] [2024-11-14 03:54:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:43,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750022244] [2024-11-14 03:54:43,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750022244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940229343] [2024-11-14 03:54:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:43,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:43,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:43,395 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:43,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:54:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:43,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-14 03:54:43,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:43,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:54:43,792 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:54:44,422 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:54:44,422 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:54:44,696 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 11 treesize of output 7 [2024-11-14 03:54:44,711 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 11 treesize of output 7 [2024-11-14 03:54:44,917 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:54:44,949 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:54:45,245 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:54:45,255 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:54:45,278 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 31 treesize of output 26 [2024-11-14 03:54:45,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 36 [2024-11-14 03:54:45,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:45,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2024-11-14 03:54:46,153 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:54:46,153 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 23 [2024-11-14 03:54:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:46,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:47,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1602))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1603))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (< 0 (+ (select (select .cse1 .cse0) .cse2) 5)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1602)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1603))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 7 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6)) (not (= .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) is different from false [2024-11-14 03:54:47,245 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1602))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1603))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (< 0 (+ 5 (select (select .cse2 .cse0) .cse1))))))) (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1602 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1602)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1603))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< (+ 7 (select (select .cse6 .cse5) .cse7)) (select |c_#length| (select (select .cse8 .cse5) .cse7))) (not (= .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2024-11-14 03:54:47,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1599 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1599) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1602))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1600) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1603))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse0)) (< 0 (+ 5 (select (select .cse1 .cse2) .cse0))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1599 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1600) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1603)) (.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1599) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1602))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 7 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse7)) (not (= .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) is different from false [2024-11-14 03:54:47,534 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:54:47,535 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 2 case distinctions, treesize of input 22156 treesize of output 19430 [2024-11-14 03:54:47,653 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:54:47,654 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 2 case distinctions, treesize of input 11544 treesize of output 9322 [2024-11-14 03:54:48,242 INFO L349 Elim1Store]: treesize reduction 174, result has 50.4 percent of original size [2024-11-14 03:54:48,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 27758 treesize of output 26947 [2024-11-14 03:54:48,959 INFO L224 Elim1Store]: Index analysis took 153 ms [2024-11-14 03:54:49,750 INFO L349 Elim1Store]: treesize reduction 171, result has 57.3 percent of original size [2024-11-14 03:54:49,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 366284 treesize of output 343132 [2024-11-14 03:54:51,771 INFO L349 Elim1Store]: treesize reduction 77, result has 70.9 percent of original size [2024-11-14 03:54:51,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 31258 treesize of output 28689 [2024-11-14 03:54:53,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:53,191 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 7 new quantified variables, introduced 15 case distinctions, treesize of input 30755 treesize of output 29816 [2024-11-14 03:54:54,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:54,702 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 32299 treesize of output 31246 [2024-11-14 03:54:57,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:57,563 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 33135 treesize of output 30962 [2024-11-14 03:55:01,866 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 6 treesize of output 4 [2024-11-14 03:55:02,444 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 6 treesize of output 4 [2024-11-14 03:56:01,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:01,283 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 1900 treesize of output 1884 [2024-11-14 03:57:04,584 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 6 treesize of output 4 [2024-11-14 03:57:31,397 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 03:57:31,397 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 03:57:31,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [684376302] [2024-11-14 03:57:31,399 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 03:57:31,399 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:57:31,399 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:57:31,399 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:57:31,399 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:57:31,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 03:57:31,406 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-14 03:57:31,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:57:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-11-14 03:57:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465007349] [2024-11-14 03:57:31,412 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:31,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:57:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:57:31,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1530, Unknown=3, NotChecked=240, Total=1892 [2024-11-14 03:57:31,414 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 20 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:31,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=119, Invalid=1530, Unknown=3, NotChecked=240, Total=1892 [2024-11-14 03:57:31,419 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:31,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:57:31,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:57:31,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:31,620 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 03:57:31,622 INFO L158 Benchmark]: Toolchain (without parser) took 350764.52ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 91.4MB in the beginning and 829.8MB in the end (delta: -738.5MB). Peak memory consumption was 517.0MB. Max. memory is 16.1GB. [2024-11-14 03:57:31,622 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:57:31,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.93ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.8MB in the end (delta: 17.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:57:31,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.57ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:57:31,623 INFO L158 Benchmark]: Boogie Preprocessor took 28.84ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:57:31,623 INFO L158 Benchmark]: RCFGBuilder took 676.53ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 46.1MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:57:31,624 INFO L158 Benchmark]: TraceAbstraction took 349539.81ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 45.3MB in the beginning and 829.8MB in the end (delta: -784.5MB). Peak memory consumption was 475.1MB. Max. memory is 16.1GB. [2024-11-14 03:57:31,625 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.33ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.93ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.8MB in the end (delta: 17.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.57ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.84ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 676.53ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 46.1MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 349539.81ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 45.3MB in the beginning and 829.8MB in the end (delta: -784.5MB). Peak memory consumption was 475.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/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_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:57:34,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:57:34,133 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 03:57:34,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:57:34,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:57:34,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:57:34,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:57:34,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:57:34,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:57:34,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:57:34,190 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:57:34,190 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:57:34,191 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:57:34,191 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:57:34,191 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:57:34,193 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:57:34,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:57:34,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:57:34,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:57:34,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:57:34,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:57:34,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:57:34,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:57:34,194 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:57:34,194 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:57:34,195 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:57:34,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:57:34,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:57:34,195 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:57:34,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:57:34,195 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:57:34,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:57:34,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:57:34,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:57:34,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:57:34,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:57:34,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:57:34,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:57:34,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:57:34,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:57:34,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:57:34,198 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:57:34,199 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:34,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:57:34,199 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:57:34,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2024-11-14 03:57:34,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:57:34,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:57:34,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:57:34,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:57:34,541 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:57:34,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2c_remove_all.i Unable to find full path for "g++" [2024-11-14 03:57:36,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:57:36,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:57:36,835 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-14 03:57:36,855 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data/10b4928ed/e7176be7346f440e8713819fd15eea64/FLAGe7135f059 [2024-11-14 03:57:37,048 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/data/10b4928ed/e7176be7346f440e8713819fd15eea64 [2024-11-14 03:57:37,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:57:37,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:57:37,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:57:37,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:57:37,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:57:37,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b622fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37, skipping insertion in model container [2024-11-14 03:57:37,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:57:37,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:57:37,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:57:37,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:57:37,618 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:57:37,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37 WrapperNode [2024-11-14 03:57:37,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:57:37,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:57:37,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:57:37,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:57:37,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,666 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2024-11-14 03:57:37,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:57:37,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:57:37,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:57:37,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:57:37,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:57:37,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:57:37,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:57:37,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:57:37,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (1/1) ... [2024-11-14 03:57:37,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:57:37,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:37,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:57:37,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:57:37,759 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 03:57:37,760 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 03:57:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:57:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:57:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:57:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:57:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:57:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:57:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:57:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:57:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:57:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:57:37,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:57:37,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:57:37,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:57:38,480 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-14 03:57:38,480 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:57:38,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:57:38,492 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 03:57:38,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:57:38 BoogieIcfgContainer [2024-11-14 03:57:38,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:57:38,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:57:38,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:57:38,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:57:38,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:57:37" (1/3) ... [2024-11-14 03:57:38,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442036ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:57:38, skipping insertion in model container [2024-11-14 03:57:38,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:37" (2/3) ... [2024-11-14 03:57:38,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442036ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:57:38, skipping insertion in model container [2024-11-14 03:57:38,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:57:38" (3/3) ... [2024-11-14 03:57:38,504 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2024-11-14 03:57:38,520 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:57:38,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all.i that has 2 procedures, 102 locations, 1 initial locations, 2 loop locations, and 46 error locations. [2024-11-14 03:57:38,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:57:38,585 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;@533406e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:57:38,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-14 03:57:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:57:38,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:38,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:57:38,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:38,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash 893917874, now seen corresponding path program 1 times [2024-11-14 03:57:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:38,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616035849] [2024-11-14 03:57:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:38,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:38,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:38,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:38,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 03:57:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:38,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:57:38,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:38,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:57:38,832 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 03:57:38,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:38,836 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616035849] [2024-11-14 03:57:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616035849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:38,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:57:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929156702] [2024-11-14 03:57:38,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:38,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:57:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:38,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:57:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:57:38,868 INFO L87 Difference]: Start difference. First operand has 102 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:39,145 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-11-14 03:57:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:57:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 03:57:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:39,156 INFO L225 Difference]: With dead ends: 98 [2024-11-14 03:57:39,156 INFO L226 Difference]: Without dead ends: 95 [2024-11-14 03:57:39,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 03:57:39,161 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:39,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:57:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-14 03:57:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-14 03:57:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-14 03:57:39,212 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 6 [2024-11-14 03:57:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:39,213 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-14 03:57:39,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-14 03:57:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:57:39,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:39,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:57:39,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 03:57:39,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:39,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 893917875, now seen corresponding path program 1 times [2024-11-14 03:57:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806935970] [2024-11-14 03:57:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:39,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:39,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:39,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:39,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 03:57:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:39,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:57:39,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:39,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:57:39,635 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 03:57:39,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:39,635 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806935970] [2024-11-14 03:57:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806935970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:39,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:39,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:57:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060508284] [2024-11-14 03:57:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:39,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:57:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:57:39,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:57:39,642 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:39,904 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-14 03:57:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:57:39,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 03:57:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:39,907 INFO L225 Difference]: With dead ends: 92 [2024-11-14 03:57:39,907 INFO L226 Difference]: Without dead ends: 92 [2024-11-14 03:57:39,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 03:57:39,909 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:39,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:57:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-14 03:57:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-14 03:57:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 88 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-14 03:57:39,925 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2024-11-14 03:57:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:39,925 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-14 03:57:39,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-14 03:57:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:57:39,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:39,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:39,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:40,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:40,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1092470457, now seen corresponding path program 1 times [2024-11-14 03:57:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355204568] [2024-11-14 03:57:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:40,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:40,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:40,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:40,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 03:57:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:40,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:57:40,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:40,273 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 03:57:40,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:40,278 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355204568] [2024-11-14 03:57:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355204568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:40,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:57:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045973160] [2024-11-14 03:57:40,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:57:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:57:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:57:40,280 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:57:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:40,304 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-14 03:57:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:57:40,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-14 03:57:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:40,306 INFO L225 Difference]: With dead ends: 103 [2024-11-14 03:57:40,306 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 03:57:40,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 03:57:40,306 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:40,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:57:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 03:57:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-11-14 03:57:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 50 states have (on average 1.86) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-14 03:57:40,323 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 14 [2024-11-14 03:57:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:40,324 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-14 03:57:40,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:57:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-14 03:57:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:57:40,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:40,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:40,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 03:57:40,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:40,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:40,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash -856997311, now seen corresponding path program 1 times [2024-11-14 03:57:40,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:40,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073102799] [2024-11-14 03:57:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:40,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:40,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:40,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:40,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 03:57:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:40,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:57:40,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:40,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:57:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:40,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:40,760 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073102799] [2024-11-14 03:57:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073102799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:40,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:40,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:57:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219404794] [2024-11-14 03:57:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:40,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:57:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:57:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:57:40,762 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:57:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:41,258 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-14 03:57:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:57:41,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-14 03:57:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:41,260 INFO L225 Difference]: With dead ends: 92 [2024-11-14 03:57:41,260 INFO L226 Difference]: Without dead ends: 92 [2024-11-14 03:57:41,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:57:41,261 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:41,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:57:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-14 03:57:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-14 03:57:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.84) internal successors, (92), 88 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-14 03:57:41,267 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 24 [2024-11-14 03:57:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:41,267 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-14 03:57:41,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:57:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-14 03:57:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:57:41,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:41,268 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:41,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 03:57:41,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:41,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:41,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash -856997310, now seen corresponding path program 1 times [2024-11-14 03:57:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795515797] [2024-11-14 03:57:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:41,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:41,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:41,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:41,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 03:57:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:41,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:57:41,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:41,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:57:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:41,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:41,765 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:41,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795515797] [2024-11-14 03:57:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795515797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:41,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:57:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185011594] [2024-11-14 03:57:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:57:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:57:41,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:57:41,769 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:57:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:42,276 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-14 03:57:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:57:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-14 03:57:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:42,280 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:57:42,280 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 03:57:42,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:57:42,281 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 6 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:42,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 282 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:57:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 03:57:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-14 03:57:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.82) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-14 03:57:42,290 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 24 [2024-11-14 03:57:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:42,290 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-14 03:57:42,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:57:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-14 03:57:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:57:42,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:42,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:42,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:42,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:42,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:42,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1059304642, now seen corresponding path program 1 times [2024-11-14 03:57:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:42,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357471558] [2024-11-14 03:57:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:42,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:42,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:42,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 03:57:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:42,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:57:42,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:42,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:57:42,744 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:57:42,858 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-14 03:57:42,859 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 21 treesize of output 20 [2024-11-14 03:57:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 03:57:42,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:43,228 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357471558] [2024-11-14 03:57:43,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357471558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2043919307] [2024-11-14 03:57:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:43,229 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:57:43,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:57:43,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-14 03:57:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:43,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:57:43,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:43,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:57:43,638 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:57:43,638 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 20 [2024-11-14 03:57:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:43,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:43,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2043919307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:43,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:57:43,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 6] total 11 [2024-11-14 03:57:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981529800] [2024-11-14 03:57:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:43,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:57:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:57:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-14 03:57:43,695 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:44,523 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-14 03:57:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:57:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-14 03:57:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:44,525 INFO L225 Difference]: With dead ends: 96 [2024-11-14 03:57:44,526 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 03:57:44,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-14 03:57:44,527 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:44,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 349 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:57:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 03:57:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-14 03:57:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:57:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-14 03:57:44,538 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2024-11-14 03:57:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:44,538 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-14 03:57:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-14 03:57:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:57:44,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:44,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:44,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:44,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 03:57:44,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:44,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:44,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1059304643, now seen corresponding path program 1 times [2024-11-14 03:57:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:44,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466609635] [2024-11-14 03:57:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:44,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:44,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:44,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:44,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 03:57:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:45,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 03:57:45,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:45,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:57:45,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:57:45,383 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:57:45,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:57:45,470 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:57:45,496 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:57:45,496 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 13 [2024-11-14 03:57:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 03:57:45,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:47,800 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466609635] [2024-11-14 03:57:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466609635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503645483] [2024-11-14 03:57:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:57:47,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:57:47,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-14 03:57:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:48,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 03:57:48,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:48,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:57:48,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:57:48,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:57:48,385 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:57:48,403 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:57:48,403 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 13 [2024-11-14 03:57:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 03:57:48,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1503645483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:48,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329401633] [2024-11-14 03:57:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:48,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:48,653 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:48,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:57:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:48,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:57:48,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:48,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:57:49,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:57:49,064 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:57:49,080 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:57:49,081 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 13 [2024-11-14 03:57:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 03:57:49,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:51,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329401633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:51,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:57:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 9 [2024-11-14 03:57:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802005288] [2024-11-14 03:57:51,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:51,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:57:51,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:51,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:57:51,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=86, Unknown=2, NotChecked=18, Total=132 [2024-11-14 03:57:51,352 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:52,301 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-11-14 03:57:52,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:57:52,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-14 03:57:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:52,302 INFO L225 Difference]: With dead ends: 96 [2024-11-14 03:57:52,303 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 03:57:52,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=33, Invalid=125, Unknown=2, NotChecked=22, Total=182 [2024-11-14 03:57:52,304 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:52,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 95 Unchecked, 0.8s Time] [2024-11-14 03:57:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 03:57:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-14 03:57:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:57:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-14 03:57:52,310 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 26 [2024-11-14 03:57:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:52,310 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-14 03:57:52,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-14 03:57:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:57:52,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:52,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:52,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:57:52,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-14 03:57:52,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-14 03:57:52,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:52,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 84665912, now seen corresponding path program 1 times [2024-11-14 03:57:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441130714] [2024-11-14 03:57:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:52,919 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:52,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-14 03:57:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:53,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:57:53,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:53,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:53,206 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441130714] [2024-11-14 03:57:53,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441130714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1699057604] [2024-11-14 03:57:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:53,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:53,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:57:53,211 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:57:53,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-14 03:57:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:53,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:57:53,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:53,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:53,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1699057604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:53,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515838540] [2024-11-14 03:57:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:53,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:53,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:53,541 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:53,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:57:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:53,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:57:53,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:53,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515838540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:53,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:57:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 6 [2024-11-14 03:57:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481438702] [2024-11-14 03:57:53,786 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:57:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:57:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:57:53,788 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:54,014 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-14 03:57:54,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:57:54,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-14 03:57:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:54,015 INFO L225 Difference]: With dead ends: 96 [2024-11-14 03:57:54,015 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 03:57:54,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 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:57:54,016 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:54,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 409 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:57:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 03:57:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-14 03:57:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:57:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-14 03:57:54,022 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 28 [2024-11-14 03:57:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:54,022 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-14 03:57:54,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-14 03:57:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:57:54,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:54,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:54,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:54,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-14 03:57:54,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-14 03:57:54,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:54,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:54,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1675104688, now seen corresponding path program 1 times [2024-11-14 03:57:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:54,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529965535] [2024-11-14 03:57:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:54,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:54,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:54,627 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:54,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-14 03:57:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:54,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:57:54,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:57:54,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:54,863 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 03:57:54,863 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 16 treesize of output 15 [2024-11-14 03:57:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:57:54,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529965535] [2024-11-14 03:57:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529965535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725207194] [2024-11-14 03:57:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:54,895 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:54,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:57:54,901 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:57:54,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-14 03:57:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:55,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:57:55,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:57:55,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:55,237 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 03:57:55,238 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 16 treesize of output 15 [2024-11-14 03:57:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:57:55,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [725207194] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134925611] [2024-11-14 03:57:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:55,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:55,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:55,289 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:55,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 03:57:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:55,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:57:55,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:57:55,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:55,487 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 03:57:55,488 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 16 treesize of output 15 [2024-11-14 03:57:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:57:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134925611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:55,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:57:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 3 [2024-11-14 03:57:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643696454] [2024-11-14 03:57:55,523 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:57:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:57:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:57:55,524 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:55,810 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-11-14 03:57:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:57:55,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-14 03:57:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:55,813 INFO L225 Difference]: With dead ends: 100 [2024-11-14 03:57:55,813 INFO L226 Difference]: Without dead ends: 100 [2024-11-14 03:57:55,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 166 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 03:57:55,814 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:55,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:57:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-14 03:57:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-14 03:57:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:57:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2024-11-14 03:57:55,820 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 29 [2024-11-14 03:57:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:55,820 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2024-11-14 03:57:55,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:57:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-11-14 03:57:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:57:55,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:55,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:55,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 03:57:56,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:56,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-14 03:57:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:56,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:57:56,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1675104687, now seen corresponding path program 1 times [2024-11-14 03:57:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:56,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098650306] [2024-11-14 03:57:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:57:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:56,427 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:57:56,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 03:57:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:56,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:57:56,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:56,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:56,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:56,879 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 22 treesize of output 26 [2024-11-14 03:57:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:57,334 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098650306] [2024-11-14 03:57:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098650306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1094475058] [2024-11-14 03:57:57,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:57,335 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:57:57,337 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:57:57,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-14 03:57:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:57,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 03:57:57,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:57,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:57,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:57,847 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 22 treesize of output 26 [2024-11-14 03:57:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1094475058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597526092] [2024-11-14 03:57:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:58,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:58,093 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:58,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 03:57:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:58,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:57:58,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:58,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:58,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:58,403 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 22 treesize of output 26 [2024-11-14 03:57:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:57:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597526092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:58,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:57:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2024-11-14 03:57:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138370229] [2024-11-14 03:57:58,611 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:57:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:58,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:57:58,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:57:58,612 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:57:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:59,416 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-11-14 03:57:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:57:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-14 03:57:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:59,419 INFO L225 Difference]: With dead ends: 103 [2024-11-14 03:57:59,419 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 03:57:59,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:57:59,420 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 10 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:59,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 697 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:57:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 03:57:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2024-11-14 03:57:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 57 states have (on average 1.736842105263158) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:57:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2024-11-14 03:57:59,434 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 29 [2024-11-14 03:57:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:59,434 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2024-11-14 03:57:59,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:57:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2024-11-14 03:57:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:57:59,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:59,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:59,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-14 03:57:59,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-14 03:57:59,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 03:58:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:00,036 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:58:00,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash -388637772, now seen corresponding path program 1 times [2024-11-14 03:58:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898503128] [2024-11-14 03:58:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:00,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:00,039 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:00,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-14 03:58:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:00,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:58:00,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:00,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:58:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:58:00,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:00,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:00,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898503128] [2024-11-14 03:58:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898503128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:00,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:58:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544697136] [2024-11-14 03:58:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:00,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:58:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:00,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:58:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:58:00,340 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:58:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:01,021 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-14 03:58:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:58:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-14 03:58:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:01,023 INFO L225 Difference]: With dead ends: 98 [2024-11-14 03:58:01,023 INFO L226 Difference]: Without dead ends: 98 [2024-11-14 03:58:01,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:58:01,024 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:01,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 287 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:58:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-14 03:58:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-14 03:58:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.719298245614035) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:58:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-14 03:58:01,028 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 30 [2024-11-14 03:58:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-14 03:58:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:58:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-14 03:58:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:58:01,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:01,034 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:01,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-14 03:58:01,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:01,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:58:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -388637771, now seen corresponding path program 1 times [2024-11-14 03:58:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:01,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473373157] [2024-11-14 03:58:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:01,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:01,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:01,237 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:01,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-14 03:58:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:01,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:58:01,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:01,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:58:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:58:01,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:01,593 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:01,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473373157] [2024-11-14 03:58:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473373157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:01,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:01,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:58:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092691705] [2024-11-14 03:58:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:01,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:58:01,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:58:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:58:01,594 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:58:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:02,312 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-11-14 03:58:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:58:02,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-14 03:58:02,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:02,313 INFO L225 Difference]: With dead ends: 97 [2024-11-14 03:58:02,313 INFO L226 Difference]: Without dead ends: 97 [2024-11-14 03:58:02,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:58:02,314 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:02,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 317 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:58:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-14 03:58:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-14 03:58:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:58:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-14 03:58:02,318 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 30 [2024-11-14 03:58:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:02,319 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-14 03:58:02,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:58:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-14 03:58:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:58:02,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:02,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:02,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-14 03:58:02,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:02,521 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:58:02,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1906559949, now seen corresponding path program 1 times [2024-11-14 03:58:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539558187] [2024-11-14 03:58:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:02,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:02,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:02,525 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:02,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 03:58:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:02,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:58:02,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:58:02,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:02,754 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:02,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539558187] [2024-11-14 03:58:02,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539558187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:02,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:02,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:58:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661039921] [2024-11-14 03:58:02,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:02,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:58:02,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:02,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:58:02,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:58:02,755 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:58:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:02,778 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2024-11-14 03:58:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:58:02,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-14 03:58:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:02,780 INFO L225 Difference]: With dead ends: 148 [2024-11-14 03:58:02,780 INFO L226 Difference]: Without dead ends: 148 [2024-11-14 03:58:02,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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 03:58:02,781 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 160 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:02,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 174 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:58:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-14 03:58:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2024-11-14 03:58:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:58:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-14 03:58:02,786 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 34 [2024-11-14 03:58:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:02,787 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-14 03:58:02,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:58:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-14 03:58:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:58:02,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:02,788 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:02,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-14 03:58:02,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:02,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:58:02,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1906559945, now seen corresponding path program 1 times [2024-11-14 03:58:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461420155] [2024-11-14 03:58:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:02,991 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:02,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-14 03:58:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:03,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 03:58:03,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:03,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:58:03,293 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 03:58:03,294 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 16 treesize of output 17 [2024-11-14 03:58:03,358 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-14 03:58:03,403 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:58:03,403 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 28 [2024-11-14 03:58:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-14 03:58:03,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:58:04,176 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:04,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461420155] [2024-11-14 03:58:04,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461420155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:58:04,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1986815888] [2024-11-14 03:58:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:04,177 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:58:04,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:58:04,179 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:58:04,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-14 03:58:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:04,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:58:04,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:04,645 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:58:04,645 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 20 [2024-11-14 03:58:04,696 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:58:04,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 03:58:04,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:58:04,892 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-14 03:58:04,893 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 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-14 03:58:05,007 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:58:05,007 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 24 treesize of output 20 [2024-11-14 03:58:05,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:58:05,237 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-14 03:58:05,237 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 2 case distinctions, treesize of input 32 treesize of output 38 [2024-11-14 03:58:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:58:05,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1986815888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:58:05,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341538780] [2024-11-14 03:58:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:05,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:05,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:58:05,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:58:05,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 03:58:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:06,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 03:58:06,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:06,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:58:06,146 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 03:58:06,146 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 16 treesize of output 17 [2024-11-14 03:58:06,223 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:58:06,223 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 28 [2024-11-14 03:58:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-14 03:58:06,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:58:06,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341538780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:58:06,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 03:58:06,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8, 10, 10] total 23 [2024-11-14 03:58:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299469256] [2024-11-14 03:58:06,782 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 03:58:06,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 03:58:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 03:58:06,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=454, Unknown=1, NotChecked=44, Total=600 [2024-11-14 03:58:06,784 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:58:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:09,259 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2024-11-14 03:58:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:58:09,260 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-14 03:58:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:09,261 INFO L225 Difference]: With dead ends: 132 [2024-11-14 03:58:09,261 INFO L226 Difference]: Without dead ends: 132 [2024-11-14 03:58:09,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 143 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=173, Invalid=700, Unknown=1, NotChecked=56, Total=930 [2024-11-14 03:58:09,262 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 368 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:09,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 354 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 519 Invalid, 0 Unknown, 120 Unchecked, 1.7s Time] [2024-11-14 03:58:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-14 03:58:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2024-11-14 03:58:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:58:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-14 03:58:09,270 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 34 [2024-11-14 03:58:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:09,270 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-14 03:58:09,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:58:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-14 03:58:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:58:09,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:09,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:09,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-14 03:58:09,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-14 03:58:09,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 03:58:09,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:09,875 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:58:09,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1906559944, now seen corresponding path program 1 times [2024-11-14 03:58:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703779771] [2024-11-14 03:58:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:09,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:09,877 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:09,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-14 03:58:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:10,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 03:58:10,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:10,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:58:10,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:58:10,150 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:58:10,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:58:10,203 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:58:10,214 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:58:10,215 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 13 [2024-11-14 03:58:10,262 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv12 32)) |c_#length|)) is different from true [2024-11-14 03:58:10,316 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-14 03:58:10,316 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 12 treesize of output 18 [2024-11-14 03:58:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 03:58:10,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:10,828 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703779771] [2024-11-14 03:58:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703779771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:58:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513868492] [2024-11-14 03:58:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:10,829 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:58:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:58:10,833 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:58:10,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-14 03:58:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:11,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:58:11,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:11,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:58:11,314 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 5 treesize of output 3 [2024-11-14 03:58:11,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:58:11,495 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:58:11,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 5 treesize of output 3 [2024-11-14 03:58:11,643 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (not (= |c_#StackHeapBarrier| (_ bv0 32)))) is different from true [2024-11-14 03:58:11,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:58:11,760 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:58:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 03:58:12,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1513868492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:58:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518049510] [2024-11-14 03:58:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:14,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:58:14,451 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:58:14,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 03:58:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:14,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 03:58:14,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:14,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:58:14,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:58:14,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:58:14,823 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:58:14,847 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:58:14,847 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 27 [2024-11-14 03:58:15,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:58:15,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:58:15,082 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-14 03:58:15,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 03:58:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-14 03:58:15,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518049510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:58:17,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:58:17,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-11-14 03:58:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405322583] [2024-11-14 03:58:17,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:58:17,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 03:58:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:17,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 03:58:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=428, Unknown=5, NotChecked=132, Total=650 [2024-11-14 03:58:17,458 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 21 states, 18 states have (on average 4.444444444444445) internal successors, (80), 17 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:58:18,459 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv12 32)) |c_#length|)) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (not (= |c_#StackHeapBarrier| (_ bv0 32)))) is different from true [2024-11-14 03:58:20,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:22,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:23,031 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv12 32)) |c_#length|)) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-14 03:58:28,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:30,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:33,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:35,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:37,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:39,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:41,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:43,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:45,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:47,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:49,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:51,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:52,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:54,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:56,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:59,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:01,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:03,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:04,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:06,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:08,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:10,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:13,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:16,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:19,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:21,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:23,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:26,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:28,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:59:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:29,289 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2024-11-14 03:59:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:59:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.444444444444445) internal successors, (80), 17 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-11-14 03:59:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:29,291 INFO L225 Difference]: With dead ends: 216 [2024-11-14 03:59:29,291 INFO L226 Difference]: Without dead ends: 216 [2024-11-14 03:59:29,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=157, Invalid=785, Unknown=8, NotChecked=310, Total=1260 [2024-11-14 03:59:29,292 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 277 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 20 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 866 IncrementalHoareTripleChecker+Unchecked, 67.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:29,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 442 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 505 Invalid, 27 Unknown, 866 Unchecked, 67.3s Time] [2024-11-14 03:59:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-14 03:59:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2024-11-14 03:59:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.5779816513761469) internal successors, (172), 140 states have internal predecessors, (172), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:59:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 180 transitions. [2024-11-14 03:59:29,298 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 180 transitions. Word has length 34 [2024-11-14 03:59:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:29,298 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 180 transitions. [2024-11-14 03:59:29,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.444444444444445) internal successors, (80), 17 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:59:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 180 transitions. [2024-11-14 03:59:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:59:29,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:29,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:29,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-14 03:59:29,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 03:59:29,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-14 03:59:29,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:29,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:59:29,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1026183870, now seen corresponding path program 1 times [2024-11-14 03:59:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124190763] [2024-11-14 03:59:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:29,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:29,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:29,905 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:59:29,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-14 03:59:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:30,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:59:30,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:30,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:59:30,894 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 19 treesize of output 11 [2024-11-14 03:59:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:59:31,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:31,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:31,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124190763] [2024-11-14 03:59:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124190763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:31,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:59:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646501619] [2024-11-14 03:59:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:31,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:59:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:59:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:59:31,028 INFO L87 Difference]: Start difference. First operand 148 states and 180 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:34,882 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2024-11-14 03:59:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:59:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-14 03:59:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:34,884 INFO L225 Difference]: With dead ends: 184 [2024-11-14 03:59:34,884 INFO L226 Difference]: Without dead ends: 184 [2024-11-14 03:59:34,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:59:34,885 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 51 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:34,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 380 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-14 03:59:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-14 03:59:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 150. [2024-11-14 03:59:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.5855855855855856) internal successors, (176), 142 states have internal predecessors, (176), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:59:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2024-11-14 03:59:34,890 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 35 [2024-11-14 03:59:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:34,891 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2024-11-14 03:59:34,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2024-11-14 03:59:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:59:34,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:34,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:34,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-14 03:59:35,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:35,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:59:35,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1026183871, now seen corresponding path program 1 times [2024-11-14 03:59:35,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:35,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119748761] [2024-11-14 03:59:35,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:35,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:35,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:35,095 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:59:35,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-14 03:59:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:35,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:59:35,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:35,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:59:36,436 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 17 treesize of output 9 [2024-11-14 03:59:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:59:36,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:36,611 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119748761] [2024-11-14 03:59:36,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119748761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:36,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:36,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:59:36,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212433904] [2024-11-14 03:59:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:36,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:59:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:59:36,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:59:36,612 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:40,493 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2024-11-14 03:59:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:59:40,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-14 03:59:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:40,495 INFO L225 Difference]: With dead ends: 187 [2024-11-14 03:59:40,495 INFO L226 Difference]: Without dead ends: 187 [2024-11-14 03:59:40,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:59:40,496 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 53 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:40,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 428 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-14 03:59:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-14 03:59:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 150. [2024-11-14 03:59:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.5675675675675675) internal successors, (174), 142 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:59:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2024-11-14 03:59:40,504 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 35 [2024-11-14 03:59:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:40,505 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2024-11-14 03:59:40,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2024-11-14 03:59:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:59:40,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:40,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:40,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-14 03:59:40,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:40,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:59:40,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:40,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1609568207, now seen corresponding path program 1 times [2024-11-14 03:59:40,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:40,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286200408] [2024-11-14 03:59:40,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:40,714 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:59:40,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-14 03:59:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:40,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:59:40,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:40,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:59:42,218 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 17 treesize of output 9 [2024-11-14 03:59:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:59:42,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:42,367 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286200408] [2024-11-14 03:59:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286200408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:42,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:59:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380157319] [2024-11-14 03:59:42,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:42,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:59:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:59:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:59:42,368 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:46,025 INFO L93 Difference]: Finished difference Result 186 states and 226 transitions. [2024-11-14 03:59:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:59:46,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-14 03:59:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:46,027 INFO L225 Difference]: With dead ends: 186 [2024-11-14 03:59:46,027 INFO L226 Difference]: Without dead ends: 186 [2024-11-14 03:59:46,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:59:46,027 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:46,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 422 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-14 03:59:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-14 03:59:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 160. [2024-11-14 03:59:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 152 states have internal predecessors, (190), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:59:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2024-11-14 03:59:46,033 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 40 [2024-11-14 03:59:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:46,033 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2024-11-14 03:59:46,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2024-11-14 03:59:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:59:46,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:46,034 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:46,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-11-14 03:59:46,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:46,235 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:59:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1609568208, now seen corresponding path program 1 times [2024-11-14 03:59:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107292997] [2024-11-14 03:59:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:46,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:46,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:46,237 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:59:46,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-14 03:59:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:46,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:59:46,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:46,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:59:47,309 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 19 treesize of output 11 [2024-11-14 03:59:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:59:47,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:47,434 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107292997] [2024-11-14 03:59:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107292997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:47,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:59:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931841782] [2024-11-14 03:59:47,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:47,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:59:47,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:47,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:59:47,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:59:47,435 INFO L87 Difference]: Start difference. First operand 160 states and 198 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:51,073 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2024-11-14 03:59:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:59:51,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-14 03:59:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:51,074 INFO L225 Difference]: With dead ends: 181 [2024-11-14 03:59:51,074 INFO L226 Difference]: Without dead ends: 181 [2024-11-14 03:59:51,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:59:51,075 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 40 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:51,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 388 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-14 03:59:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-14 03:59:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2024-11-14 03:59:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.5537190082644627) internal successors, (188), 152 states have internal predecessors, (188), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:59:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 196 transitions. [2024-11-14 03:59:51,081 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 196 transitions. Word has length 40 [2024-11-14 03:59:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:51,081 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 196 transitions. [2024-11-14 03:59:51,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions. [2024-11-14 03:59:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:59:51,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:51,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:51,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2024-11-14 03:59:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:51,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:59:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1609582111, now seen corresponding path program 1 times [2024-11-14 03:59:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997055991] [2024-11-14 03:59:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:51,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:51,285 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:59:51,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-14 03:59:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:51,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:59:51,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:59:52,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:52,531 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997055991] [2024-11-14 03:59:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997055991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:52,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:59:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239222938] [2024-11-14 03:59:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:59:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:59:52,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:59:52,533 INFO L87 Difference]: Start difference. First operand 160 states and 196 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:55,918 INFO L93 Difference]: Finished difference Result 209 states and 262 transitions. [2024-11-14 03:59:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:59:55,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-14 03:59:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:55,920 INFO L225 Difference]: With dead ends: 209 [2024-11-14 03:59:55,920 INFO L226 Difference]: Without dead ends: 209 [2024-11-14 03:59:55,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:59:55,921 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:55,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 536 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-14 03:59:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-14 03:59:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2024-11-14 03:59:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.6) internal successors, (232), 176 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:59:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2024-11-14 03:59:55,928 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 240 transitions. Word has length 40 [2024-11-14 03:59:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:55,928 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 240 transitions. [2024-11-14 03:59:55,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:59:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 240 transitions. [2024-11-14 03:59:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:59:55,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:55,929 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:55,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2024-11-14 03:59:56,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:56,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:59:56,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash 7614937, now seen corresponding path program 1 times [2024-11-14 03:59:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:56,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105394451] [2024-11-14 03:59:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:56,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:56,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:56,133 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:59:56,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-14 03:59:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:56,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:59:56,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:59:56,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:59:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:59:57,081 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105394451] [2024-11-14 03:59:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105394451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:59:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [649705112] [2024-11-14 03:59:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:59:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:59:57,084 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:59:57,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-14 03:59:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:57,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:59:57,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:59:57,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:59:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:59:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [649705112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:59:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112478630] [2024-11-14 03:59:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:57,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:59:57,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:59:57,953 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:59:57,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-14 03:59:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:58,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:59:58,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:59:58,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:59:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:59:58,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112478630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:59:58,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:59:58,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2024-11-14 03:59:58,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165578121] [2024-11-14 03:59:58,538 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:59:58,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:59:58,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:58,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:59:58,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:59:58,539 INFO L87 Difference]: Start difference. First operand 184 states and 240 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:59:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:58,683 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2024-11-14 03:59:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:59:58,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-11-14 03:59:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:58,688 INFO L225 Difference]: With dead ends: 101 [2024-11-14 03:59:58,688 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 03:59:58,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:59:58,689 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:58,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:59:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 03:59:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-14 03:59:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 96 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:59:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-14 03:59:58,693 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 41 [2024-11-14 03:59:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:58,695 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-14 03:59:58,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:59:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-14 03:59:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:59:58,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:58,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:58,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-14 03:59:58,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2024-11-14 03:59:59,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2024-11-14 03:59:59,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:59,298 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:59:59,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1642562208, now seen corresponding path program 1 times [2024-11-14 03:59:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:59,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951973463] [2024-11-14 03:59:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:59,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:59:59,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:59,300 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:59:59,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2024-11-14 03:59:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:59,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 03:59:59,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:00:02,829 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 04:00:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:00:03,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:00:03,129 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:00:03,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951973463] [2024-11-14 04:00:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951973463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:00:03,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:00:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 04:00:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289631316] [2024-11-14 04:00:03,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:00:03,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:00:03,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:00:03,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:00:03,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:00:03,130 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:00:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:00:10,094 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2024-11-14 04:00:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:00:10,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-14 04:00:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:00:10,097 INFO L225 Difference]: With dead ends: 115 [2024-11-14 04:00:10,097 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 04:00:10,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-14 04:00:10,099 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:00:10,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 352 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-14 04:00:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 04:00:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2024-11-14 04:00:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 96 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:00:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-14 04:00:10,108 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 41 [2024-11-14 04:00:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:00:10,108 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-14 04:00:10,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:00:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-14 04:00:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 04:00:10,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:00:10,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:00:10,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2024-11-14 04:00:10,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:00:10,310 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 04:00:10,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:00:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -606819695, now seen corresponding path program 1 times [2024-11-14 04:00:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:00:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617692776] [2024-11-14 04:00:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:10,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:00:10,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:00:10,313 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:00:10,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-11-14 04:00:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:10,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 04:00:10,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:00:10,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 04:00:11,681 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:00:11,682 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 13 [2024-11-14 04:00:12,063 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 11 treesize of output 7 [2024-11-14 04:00:12,391 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:00:12,391 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 43 treesize of output 40 [2024-11-14 04:00:13,148 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:00:13,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 04:00:13,226 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 35 treesize of output 26 [2024-11-14 04:00:14,453 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 7 treesize of output 3 [2024-11-14 04:00:15,034 INFO L349 Elim1Store]: treesize reduction 6, result has 76.0 percent of original size [2024-11-14 04:00:15,034 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 39 [2024-11-14 04:00:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:00:15,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:00:16,504 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 28 treesize of output 20 [2024-11-14 04:00:18,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2184))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)))))) is different from false [2024-11-14 04:00:18,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2184))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2024-11-14 04:00:18,475 INFO L349 Elim1Store]: treesize reduction 7, result has 84.8 percent of original size [2024-11-14 04:00:18,476 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 52 treesize of output 51 [2024-11-14 04:00:18,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_2183 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2183) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2184))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2024-11-14 04:00:18,975 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 04:00:18,975 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 2 case distinctions, treesize of input 2236 treesize of output 1718 [2024-11-14 04:00:21,210 INFO L349 Elim1Store]: treesize reduction 174, result has 50.4 percent of original size [2024-11-14 04:00:21,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 11660 treesize of output 10979 [2024-11-14 04:00:22,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:00:22,145 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 5980 treesize of output 5692 [2024-11-14 04:00:22,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:00:22,886 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 5978 treesize of output 5832 [2024-11-14 04:00:23,942 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 6 treesize of output 4 [2024-11-14 04:00:27,540 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:00:28,835 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:00:29,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:00:29,163 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 222 treesize of output 226 [2024-11-14 04:00:30,740 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:00:35,314 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 6 treesize of output 4 [2024-11-14 04:00:44,587 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 6 treesize of output 4 [2024-11-14 04:00:48,336 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 6 treesize of output 4 [2024-11-14 04:00:50,550 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 6 treesize of output 4 [2024-11-14 04:01:08,660 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 6 treesize of output 4 [2024-11-14 04:01:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-14 04:01:11,705 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617692776] [2024-11-14 04:01:11,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617692776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955606044] [2024-11-14 04:01:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:11,706 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:11,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:11,708 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:11,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2024-11-14 04:01:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:12,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-14 04:01:12,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:12,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 04:01:15,142 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 04:01:15,142 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 27 [2024-11-14 04:01:16,370 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 11 treesize of output 7 [2024-11-14 04:01:17,122 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:01:17,122 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 43 treesize of output 40 [2024-11-14 04:01:18,492 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:01:18,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 04:01:18,637 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 35 treesize of output 26 [2024-11-14 04:01:21,460 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 7 treesize of output 3 [2024-11-14 04:01:22,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:01:22,202 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 32 [2024-11-14 04:01:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:23,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:23,771 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 28 treesize of output 20 [2024-11-14 04:01:39,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2257))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)))))) is different from false [2024-11-14 04:01:39,573 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2257))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2024-11-14 04:01:39,702 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2256) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2257))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2024-11-14 04:01:40,117 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 04:01:40,117 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 2 case distinctions, treesize of input 2364 treesize of output 1846 [2024-11-14 04:01:42,589 INFO L349 Elim1Store]: treesize reduction 174, result has 50.4 percent of original size [2024-11-14 04:01:42,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 5470 treesize of output 5203 [2024-11-14 04:01:42,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:01:42,869 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 3320 treesize of output 3096 [2024-11-14 04:01:43,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:01:43,160 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 2938 treesize of output 2824 [2024-11-14 04:01:52,509 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 6 treesize of output 4 [2024-11-14 04:01:54,506 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 6 treesize of output 4 [2024-11-14 04:01:54,787 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 6 treesize of output 4 [2024-11-14 04:02:11,766 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 6 treesize of output 4 [2024-11-14 04:02:20,916 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 6 treesize of output 4 [2024-11-14 04:02:22,508 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 6 treesize of output 4 [2024-11-14 04:02:23,402 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 6 treesize of output 4 [2024-11-14 04:02:25,499 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 6 treesize of output 4 [2024-11-14 04:02:25,907 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 6 treesize of output 4 [2024-11-14 04:02:32,676 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:02:34,077 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 151 treesize of output 147 [2024-11-14 04:02:46,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1278 treesize of output 1270 [2024-11-14 04:02:54,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:02:54,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1652 treesize of output 1650 [2024-11-14 04:03:11,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1278 treesize of output 1270 [2024-11-14 04:03:17,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1278 treesize of output 1270 [2024-11-14 04:03:20,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:03:21,042 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 6 treesize of output 4 [2024-11-14 04:03:23,633 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:24,017 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:27,396 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:27,835 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:27,890 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:29,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:29,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 274 [2024-11-14 04:03:30,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:30,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 170 [2024-11-14 04:03:33,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:33,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2024-11-14 04:03:33,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:03:34,515 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:36,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:03:37,951 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:39,085 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:52,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:52,631 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 245 treesize of output 237 [2024-11-14 04:04:07,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1955606044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:04:07,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200477424] [2024-11-14 04:04:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:07,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:04:07,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:04:07,101 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:04:07,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-14 04:04:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:07,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 04:04:07,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:04:07,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 04:04:08,744 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:04:08,744 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 13 [2024-11-14 04:04:09,851 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 11 treesize of output 7 [2024-11-14 04:04:10,556 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 04:04:11,834 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 04:04:11,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2024-11-14 04:04:14,515 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 60 [2024-11-14 04:04:15,589 INFO L349 Elim1Store]: treesize reduction 6, result has 77.8 percent of original size [2024-11-14 04:04:15,589 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 68 treesize of output 41 [2024-11-14 04:04:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:15,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:15,843 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 28 treesize of output 20 [2024-11-14 04:04:16,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2329))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) is different from false [2024-11-14 04:04:16,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2329))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2024-11-14 04:04:16,319 INFO L349 Elim1Store]: treesize reduction 7, result has 84.8 percent of original size [2024-11-14 04:04:16,319 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 52 treesize of output 51 [2024-11-14 04:04:16,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2328) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2329))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2024-11-14 04:04:16,849 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 04:04:16,850 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 2 case distinctions, treesize of input 1108 treesize of output 862 [2024-11-14 04:04:19,383 INFO L349 Elim1Store]: treesize reduction 157, result has 55.3 percent of original size [2024-11-14 04:04:19,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 3256 treesize of output 3220 [2024-11-14 04:04:19,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:04:19,612 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 3133 treesize of output 3041 [2024-11-14 04:04:19,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:04:19,898 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 3443 treesize of output 3263 [2024-11-14 04:04:20,943 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 6 treesize of output 4 [2024-11-14 04:04:26,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:04:26,622 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 110 treesize of output 114 [2024-11-14 04:04:32,682 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:04:33,450 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 6 treesize of output 4 [2024-11-14 04:04:40,800 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 6 treesize of output 4 [2024-11-14 04:04:41,471 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 6 treesize of output 4 [2024-11-14 04:04:42,268 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 6 treesize of output 4 [2024-11-14 04:04:44,531 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 6 treesize of output 4 [2024-11-14 04:04:46,015 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 6 treesize of output 4 [2024-11-14 04:04:46,841 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 6 treesize of output 4 [2024-11-14 04:05:07,713 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 6 treesize of output 4 [2024-11-14 04:05:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-14 04:05:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200477424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:05:09,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 04:05:09,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21, 20, 21] total 67 [2024-11-14 04:05:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352061597] [2024-11-14 04:05:09,004 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 04:05:09,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-14 04:05:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:05:09,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-14 04:05:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=4280, Unknown=16, NotChecked=1260, Total=5852 [2024-11-14 04:05:09,009 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 68 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 60 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-14 04:05:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:05:27,090 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2024-11-14 04:05:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 04:05:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 60 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 42 [2024-11-14 04:05:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:05:27,092 INFO L225 Difference]: With dead ends: 119 [2024-11-14 04:05:27,092 INFO L226 Difference]: Without dead ends: 119 [2024-11-14 04:05:27,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=363, Invalid=5059, Unknown=16, NotChecked=1368, Total=6806 [2024-11-14 04:05:27,093 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 147 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:05:27,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 928 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1592 Invalid, 0 Unknown, 562 Unchecked, 14.1s Time] [2024-11-14 04:05:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-14 04:05:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2024-11-14 04:05:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.379746835443038) internal successors, (109), 98 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:05:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-14 04:05:27,096 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 42 [2024-11-14 04:05:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:05:27,097 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-14 04:05:27,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 60 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-14 04:05:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-14 04:05:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 04:05:27,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:05:27,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:05:27,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2024-11-14 04:05:27,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2024-11-14 04:05:27,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2024-11-14 04:05:27,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:05:27,698 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 04:05:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:05:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash -606819694, now seen corresponding path program 1 times [2024-11-14 04:05:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:05:27,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28471018] [2024-11-14 04:05:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:27,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:05:27,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:05:27,701 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:05:27,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54d4aa40-c5c0-4eb2-80f4-3c0b54dbee48/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2024-11-14 04:05:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:28,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 04:05:28,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:28,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 04:05:28,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 04:05:29,716 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:05:29,716 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 04:05:29,857 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:05:29,857 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 13 [2024-11-14 04:05:30,366 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 11 treesize of output 7 [2024-11-14 04:05:30,420 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 11 treesize of output 7 [2024-11-14 04:05:30,772 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 04:05:30,830 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 04:05:31,459 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 04:05:31,532 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 04:05:31,575 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 24 [2024-11-14 04:05:31,628 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 04:05:33,618 INFO L349 Elim1Store]: treesize reduction 6, result has 76.0 percent of original size [2024-11-14 04:05:33,618 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 44 [2024-11-14 04:05:33,669 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:05:33,669 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 15 treesize of output 7 [2024-11-14 04:05:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:05:34,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:05:53,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)))) (and (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2409 (_ BitVec 32)) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2405)) (.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_2409)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse0)) (bvule (bvadd (_ bv8 32) (select (select .cse1 .cse2) .cse0)) (select |c_#length| (select (select .cse3 .cse2) .cse0))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2409 (_ BitVec 32)) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_2409)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2405))) (store .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse5)) (let ((.cse6 (select (select .cse7 .cse8) .cse5))) (bvule (bvadd (_ bv4 32) .cse6) (bvadd (_ bv8 32) .cse6))) (not (= .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))))) is different from false [2024-11-14 04:05:54,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2409 (_ BitVec 32)) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406))) (let ((.cse2 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2405))) (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_2409)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse0 (select (select .cse1 .cse2) .cse3))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2409 (_ BitVec 32)) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2405))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_2409)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (bvule (bvadd (select (select .cse8 .cse6) .cse7) (_ bv8 32)) (select |c_#length| (select (select .cse9 .cse6) .cse7))))))))) is different from false [2024-11-14 04:05:55,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2409 (_ BitVec 32)) (v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2403) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5 v_ArrVal_2409)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2404) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2405))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (let ((.cse1 (select (select .cse2 .cse3) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_2409 (_ BitVec 32)) (v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2404) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2405)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2403) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5 v_ArrVal_2409)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (bvule (bvadd (_ bv8 32) (select (select .cse7 .cse8) .cse6)) (select |c_#length| (select (select .cse9 .cse8) .cse6))) (not (= .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) is different from false [2024-11-14 04:05:56,432 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 04:05:56,432 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 2 case distinctions, treesize of input 2752 treesize of output 2434 [2024-11-14 04:05:57,086 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 04:05:57,087 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 2 case distinctions, treesize of input 11544 treesize of output 9322 [2024-11-14 04:05:57,479 INFO L224 Elim1Store]: Index analysis took 209 ms [2024-11-14 04:05:59,656 INFO L349 Elim1Store]: treesize reduction 23, result has 89.4 percent of original size [2024-11-14 04:05:59,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7084 treesize of output 6900 [2024-11-14 04:06:00,292 INFO L224 Elim1Store]: Index analysis took 322 ms [2024-11-14 04:06:04,061 INFO L349 Elim1Store]: treesize reduction 174, result has 50.4 percent of original size [2024-11-14 04:06:04,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 114092 treesize of output 107307 [2024-11-14 04:06:05,018 INFO L224 Elim1Store]: Index analysis took 370 ms