./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje --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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:27:03,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:27:03,132 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 01:27:03,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:27:03,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:27:03,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:27:03,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:27:03,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:27:03,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:27:03,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:27:03,176 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:27:03,177 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:27:03,178 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:27:03,178 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:27:03,179 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:27:03,179 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:27:03,180 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:27:03,180 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:27:03,181 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:27:03,181 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:27:03,182 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:27:03,183 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:27:03,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:27:03,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:27:03,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:27:03,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:27:03,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:27:03,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:27:03,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:27:03,187 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 01:27:03,187 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 01:27:03,188 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 01:27:03,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:27:03,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:27:03,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:27:03,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:27:03,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:27:03,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:27:03,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:27:03,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:27:03,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:27:03,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:03,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:27:03,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:27:03,199 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:27:03,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:27:03,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:27:03,200 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:27:03,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:27:03,201 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-11-09 01:27:03,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:27:03,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:27:03,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:27:03,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:27:03,628 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:27:03,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i Unable to find full path for "g++" [2024-11-09 01:27:06,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:27:06,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:27:06,519 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-09 01:27:06,547 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/data/a3dc15217/d202da4c02b14f27b4d255d2550b9cbb/FLAG724496a51 [2024-11-09 01:27:06,574 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/data/a3dc15217/d202da4c02b14f27b4d255d2550b9cbb [2024-11-09 01:27:06,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:27:06,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:27:06,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:06,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:27:06,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:27:06,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:06" (1/1) ... [2024-11-09 01:27:06,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bace54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:06, skipping insertion in model container [2024-11-09 01:27:06,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:06" (1/1) ... [2024-11-09 01:27:06,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:27:07,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:07,186 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:27:07,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:07,293 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:27:07,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07 WrapperNode [2024-11-09 01:27:07,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:07,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:07,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:27:07,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:27:07,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,358 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 112 [2024-11-09 01:27:07,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:07,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:27:07,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:27:07,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:27:07,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:27:07,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:27:07,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:27:07,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:27:07,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (1/1) ... [2024-11-09 01:27:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:07,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:07,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:27:07,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:27:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:27:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 01:27:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 01:27:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:27:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:27:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:27:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:27:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:27:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:27:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 01:27:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:27:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:27:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:27:07,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:27:07,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:27:08,234 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-09 01:27:08,235 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:27:08,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:27:08,300 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:27:08,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:08 BoogieIcfgContainer [2024-11-09 01:27:08,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:27:08,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:27:08,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:27:08,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:27:08,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:27:06" (1/3) ... [2024-11-09 01:27:08,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42247be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:08, skipping insertion in model container [2024-11-09 01:27:08,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:07" (2/3) ... [2024-11-09 01:27:08,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42247be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:08, skipping insertion in model container [2024-11-09 01:27:08,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:08" (3/3) ... [2024-11-09 01:27:08,316 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2024-11-09 01:27:08,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:27:08,341 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-09 01:27:08,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:27:08,421 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;@98fd181, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:27:08,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-09 01:27:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 87 states have internal predecessors, (96), 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-09 01:27:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:27:08,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:08,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:27:08,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:08,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 180036141, now seen corresponding path program 1 times [2024-11-09 01:27:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48861995] [2024-11-09 01:27:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:08,805 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-09 01:27:08,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48861995] [2024-11-09 01:27:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48861995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:27:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501435877] [2024-11-09 01:27:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:08,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:27:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:08,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:27:08,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:27:08,872 INFO L87 Difference]: Start difference. First operand has 91 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 87 states have internal predecessors, (96), 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-09 01:27:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:09,086 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-11-09 01:27:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:27:09,089 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-09 01:27:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:09,099 INFO L225 Difference]: With dead ends: 87 [2024-11-09 01:27:09,100 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 01:27:09,102 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-09 01:27:09,106 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:09,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:27:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 01:27:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 01:27:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 81 states have internal predecessors, (87), 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-09 01:27:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-09 01:27:09,164 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 5 [2024-11-09 01:27:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:09,165 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-09 01:27:09,166 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-09 01:27:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-09 01:27:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:27:09,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:09,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:27:09,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:27:09,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash 180036142, now seen corresponding path program 1 times [2024-11-09 01:27:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550040495] [2024-11-09 01:27:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:09,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:09,337 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-09 01:27:09,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550040495] [2024-11-09 01:27:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550040495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:27:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292345171] [2024-11-09 01:27:09,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:09,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:27:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:09,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:27:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:27:09,342 INFO L87 Difference]: Start difference. First operand 85 states and 91 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-09 01:27:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:09,484 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-09 01:27:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:27:09,485 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-09 01:27:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:09,486 INFO L225 Difference]: With dead ends: 82 [2024-11-09 01:27:09,487 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 01:27:09,487 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-09 01:27:09,514 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:09,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 128 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 01:27:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 01:27:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.048780487804878) internal successors, (84), 78 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-09 01:27:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-09 01:27:09,544 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 5 [2024-11-09 01:27:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:09,545 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-09 01:27:09,545 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-09 01:27:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-09 01:27:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:27:09,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:09,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:09,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:27:09,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1980727732, now seen corresponding path program 1 times [2024-11-09 01:27:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133701748] [2024-11-09 01:27:09,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:09,784 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-09 01:27:09,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133701748] [2024-11-09 01:27:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133701748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:09,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:09,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:27:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145281094] [2024-11-09 01:27:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:09,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:27:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:27:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:27:09,790 INFO L87 Difference]: Start difference. First operand 82 states and 88 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-09 01:27:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:09,865 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-09 01:27:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:27:09,868 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-09 01:27:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:09,869 INFO L225 Difference]: With dead ends: 94 [2024-11-09 01:27:09,870 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 01:27:09,870 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-09 01:27:09,874 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:09,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 01:27:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-11-09 01:27:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 43 states have (on average 2.0) internal successors, (86), 80 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-09 01:27:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-09 01:27:09,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 11 [2024-11-09 01:27:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:09,896 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-09 01:27:09,896 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-09 01:27:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-09 01:27:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:27:09,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:09,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:09,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:27:09,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:09,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1930979233, now seen corresponding path program 1 times [2024-11-09 01:27:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527937111] [2024-11-09 01:27:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:10,163 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-09 01:27:10,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527937111] [2024-11-09 01:27:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527937111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:10,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:10,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30972560] [2024-11-09 01:27:10,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:10,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:27:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:10,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:27:10,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:27:10,170 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 01:27:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:10,462 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-09 01:27:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:27:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2024-11-09 01:27:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:10,465 INFO L225 Difference]: With dead ends: 83 [2024-11-09 01:27:10,469 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 01:27:10,469 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-09 01:27:10,471 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:10,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 227 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:27:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 01:27:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 01:27:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 79 states have internal predecessors, (85), 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-09 01:27:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-09 01:27:10,487 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 20 [2024-11-09 01:27:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:10,492 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-09 01:27:10,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 01:27:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-09 01:27:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:27:10,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:10,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:10,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:27:10,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:10,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1930979234, now seen corresponding path program 1 times [2024-11-09 01:27:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:10,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227347104] [2024-11-09 01:27:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:10,870 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-09 01:27:10,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:10,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227347104] [2024-11-09 01:27:10,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227347104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:10,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:10,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114423990] [2024-11-09 01:27:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:10,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:27:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:27:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:27:10,877 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-09 01:27:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:11,116 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-09 01:27:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:27:11,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2024-11-09 01:27:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:11,118 INFO L225 Difference]: With dead ends: 82 [2024-11-09 01:27:11,121 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 01:27:11,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:27:11,123 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:11,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 251 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:27:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 01:27:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 01:27:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 78 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-09 01:27:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-09 01:27:11,138 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 20 [2024-11-09 01:27:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-09 01:27:11,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-09 01:27:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-09 01:27:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 01:27:11,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:11,143 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:11,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:27:11,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:11,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash 245170754, now seen corresponding path program 1 times [2024-11-09 01:27:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:11,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484427458] [2024-11-09 01:27:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:11,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:11,586 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-09 01:27:11,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484427458] [2024-11-09 01:27:11,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484427458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075311550] [2024-11-09 01:27:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:11,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:11,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:11,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:11,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:27:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:11,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:27:11,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:11,841 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-09 01:27:11,918 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-09 01:27:12,001 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:27:12,002 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-09 01:27:12,034 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-09 01:27:12,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:12,323 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-09 01:27:12,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075311550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:12,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1619431659] [2024-11-09 01:27:12,355 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 01:27:12,356 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:12,362 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:27:12,369 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:27:12,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:27:14,208 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:27:15,284 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:27:31,144 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1097#(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) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_80| |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|)) (<= 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)) (= |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_70| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_70| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_70| |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 01:27:31,145 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:27:31,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:27:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-09 01:27:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714549100] [2024-11-09 01:27:31,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:31,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:27:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:27:31,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=470, Unknown=3, NotChecked=44, Total=600 [2024-11-09 01:27:31,149 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-09 01:27:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:31,893 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-09 01:27:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:27:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 22 [2024-11-09 01:27:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:31,896 INFO L225 Difference]: With dead ends: 87 [2024-11-09 01:27:31,896 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 01:27:31,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=89, Invalid=512, Unknown=3, NotChecked=46, Total=650 [2024-11-09 01:27:31,898 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:31,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 321 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 0 Unknown, 91 Unchecked, 0.7s Time] [2024-11-09 01:27:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 01:27:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 01:27:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 82 states have internal predecessors, (90), 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-09 01:27:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-09 01:27:31,907 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 22 [2024-11-09 01:27:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:31,907 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-09 01:27:31,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-09 01:27:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-09 01:27:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 01:27:31,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:31,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:31,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:32,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 01:27:32,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 245170755, now seen corresponding path program 1 times [2024-11-09 01:27:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317710787] [2024-11-09 01:27:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:32,813 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-09 01:27:32,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317710787] [2024-11-09 01:27:32,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317710787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:32,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053793549] [2024-11-09 01:27:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:32,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:32,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:32,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:32,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:27:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:32,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:27:32,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:32,974 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-09 01:27:32,990 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-09 01:27:33,279 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-09 01:27:33,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:33,337 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-09 01:27:33,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:27:33,362 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-09 01:27:33,435 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-09 01:27:33,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053793549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:33,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531522057] [2024-11-09 01:27:33,692 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 01:27:33,692 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:33,693 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:27:33,693 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:27:33,693 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:27:34,753 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:27:35,555 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:27:51,954 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1384#(and (exists ((|v_#memory_$Pointer$.base_94| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_94| |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_84| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_84| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_84| |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|) (exists ((|v_#memory_$Pointer$.offset_94| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (<= (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-09 01:27:51,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:27:51,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:27:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-09 01:27:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707194801] [2024-11-09 01:27:51,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:51,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:27:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:51,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:27:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=822, Unknown=3, NotChecked=58, Total=992 [2024-11-09 01:27:51,959 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 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-09 01:27:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:53,498 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-11-09 01:27:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:27:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 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 22 [2024-11-09 01:27:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:53,500 INFO L225 Difference]: With dead ends: 87 [2024-11-09 01:27:53,501 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 01:27:53,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=125, Invalid=932, Unknown=3, NotChecked=62, Total=1122 [2024-11-09 01:27:53,502 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:53,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 447 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 646 Invalid, 0 Unknown, 90 Unchecked, 1.3s Time] [2024-11-09 01:27:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 01:27:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 01:27:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 82 states have internal predecessors, (89), 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-09 01:27:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-09 01:27:53,521 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 22 [2024-11-09 01:27:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:53,521 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-09 01:27:53,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 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-09 01:27:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-09 01:27:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:27:53,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:53,523 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-09 01:27:53,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:27:53,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 01:27:53,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:27:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash -613951963, now seen corresponding path program 1 times [2024-11-09 01:27:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432213373] [2024-11-09 01:27:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,938 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-09 01:27:53,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432213373] [2024-11-09 01:27:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432213373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189533600] [2024-11-09 01:27:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:53,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:53,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:53,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:27:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:27:54,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:54,145 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-09 01:27:54,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:54,237 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-09 01:27:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189533600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1169527991] [2024-11-09 01:27:54,240 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 01:27:54,241 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:54,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:27:54,242 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:27:54,242 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:27:55,247 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:27:55,792 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:28:15,563 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1719#(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-09 01:28:15,563 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:28:15,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:15,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-09 01:28:15,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250234959] [2024-11-09 01:28:15,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:15,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:28:15,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 01:28:15,566 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 01:28:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:15,739 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-11-09 01:28:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:15,740 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), 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 24 [2024-11-09 01:28:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:15,741 INFO L225 Difference]: With dead ends: 87 [2024-11-09 01:28:15,741 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 01:28:15,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 01:28:15,743 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:15,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 346 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 01:28:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 01:28:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.872340425531915) 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-09 01:28:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-09 01:28:15,753 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 24 [2024-11-09 01:28:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-09 01:28:15,754 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), 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-09 01:28:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-09 01:28:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:28:15,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:15,755 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-09 01:28:15,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:28:15,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:15,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:28:15,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:15,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1857440002, now seen corresponding path program 1 times [2024-11-09 01:28:15,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:28:15,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795835698] [2024-11-09 01:28:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:16,083 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-09 01:28:16,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:28:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795835698] [2024-11-09 01:28:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795835698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974331495] [2024-11-09 01:28:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:16,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:16,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:16,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:16,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:28:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:16,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:28:16,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:16,273 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-09 01:28:16,429 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 01:28:16,507 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 01:28:16,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 01:28:16,538 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-09 01:28:16,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974331495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097676992] [2024-11-09 01:28:16,662 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 01:28:16,663 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:28:16,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:28:16,663 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:28:16,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:28:17,648 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:28:18,292 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:28:40,744 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2015#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 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-09 01:28:40,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:28:40,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:28:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-09 01:28:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720056989] [2024-11-09 01:28:40,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:40,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:28:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:28:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:28:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=6, NotChecked=48, Total=702 [2024-11-09 01:28:40,747 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 2 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-09 01:28:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:41,583 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-09 01:28:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:28:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 2 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 25 [2024-11-09 01:28:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:41,585 INFO L225 Difference]: With dead ends: 86 [2024-11-09 01:28:41,585 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 01:28:41,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=95, Invalid=715, Unknown=6, NotChecked=54, Total=870 [2024-11-09 01:28:41,587 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 10 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:41,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 278 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 88 Unchecked, 0.7s Time] [2024-11-09 01:28:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 01:28:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 01:28:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.851063829787234) internal successors, (87), 81 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-09 01:28:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-09 01:28:41,599 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 25 [2024-11-09 01:28:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:41,600 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-09 01:28:41,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 2 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-09 01:28:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-09 01:28:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:28:41,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:41,605 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-09 01:28:41,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:28:41,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:41,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:28:41,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:41,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1857440001, now seen corresponding path program 1 times [2024-11-09 01:28:41,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:28:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994700384] [2024-11-09 01:28:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:41,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,221 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-09 01:28:42,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:28:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994700384] [2024-11-09 01:28:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994700384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327421972] [2024-11-09 01:28:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:42,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:42,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:42,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:42,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:28:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 01:28:42,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:42,423 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-09 01:28:42,435 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-09 01:28:42,787 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-09 01:28:42,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:42,848 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-09 01:28:42,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:28:42,877 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-09 01:28:42,991 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-09 01:28:42,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327421972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:43,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303154255] [2024-11-09 01:28:43,296 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 01:28:43,297 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:28:43,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:28:43,297 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:28:43,298 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:28:44,354 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:28:44,828 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:29:02,513 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2322#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22|) 3)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 01:29:02,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:29:02,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:02,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-09 01:29:02,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747482212] [2024-11-09 01:29:02,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:29:02,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:29:02,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:02,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:29:02,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-09 01:29:02,515 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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-09 01:29:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:03,633 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2024-11-09 01:29:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:29:03,633 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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 25 [2024-11-09 01:29:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:03,636 INFO L225 Difference]: With dead ends: 105 [2024-11-09 01:29:03,636 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 01:29:03,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-09 01:29:03,638 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:03,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 414 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 339 Invalid, 0 Unknown, 114 Unchecked, 0.8s Time] [2024-11-09 01:29:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 01:29:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2024-11-09 01:29:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 92 states have internal predecessors, (105), 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-09 01:29:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-09 01:29:03,645 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 25 [2024-11-09 01:29:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:03,646 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 01:29:03,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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-09 01:29:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-09 01:29:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 01:29:03,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:03,647 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] [2024-11-09 01:29:03,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 01:29:03,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1746065209, now seen corresponding path program 1 times [2024-11-09 01:29:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795849426] [2024-11-09 01:29:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:04,057 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-09 01:29:04,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795849426] [2024-11-09 01:29:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795849426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:29:04,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274758971] [2024-11-09 01:29:04,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:04,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:29:04,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:04,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:29:04,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:29:04,061 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-09 01:29:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:04,505 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2024-11-09 01:29:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:29:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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 26 [2024-11-09 01:29:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:04,507 INFO L225 Difference]: With dead ends: 97 [2024-11-09 01:29:04,507 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:29:04,507 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-09 01:29:04,508 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 8 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:04,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 263 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:29:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:29:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 01:29:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.793103448275862) internal successors, (104), 91 states have internal predecessors, (104), 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-09 01:29:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-09 01:29:04,515 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 26 [2024-11-09 01:29:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:04,515 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-09 01:29:04,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-09 01:29:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-11-09 01:29:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 01:29:04,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:04,516 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] [2024-11-09 01:29:04,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:29:04,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:04,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1746065208, now seen corresponding path program 1 times [2024-11-09 01:29:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062112963] [2024-11-09 01:29:04,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:04,857 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-09 01:29:04,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062112963] [2024-11-09 01:29:04,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062112963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:04,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:04,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:29:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030576024] [2024-11-09 01:29:04,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:04,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:29:04,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:04,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:29:04,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:29:04,860 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 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-09 01:29:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:05,301 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-11-09 01:29:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:29:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 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 26 [2024-11-09 01:29:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:05,303 INFO L225 Difference]: With dead ends: 96 [2024-11-09 01:29:05,303 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 01:29:05,303 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-09 01:29:05,304 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:05,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 310 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:29:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 01:29:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 01:29:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 90 states have internal predecessors, (103), 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-09 01:29:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-09 01:29:05,314 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 26 [2024-11-09 01:29:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:05,315 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-09 01:29:05,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 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-09 01:29:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-09 01:29:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 01:29:05,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:05,319 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-09 01:29:05,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:29:05,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:05,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1363666499, now seen corresponding path program 1 times [2024-11-09 01:29:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:05,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771264961] [2024-11-09 01:29:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:05,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:05,505 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-09 01:29:05,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:05,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771264961] [2024-11-09 01:29:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771264961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:05,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:05,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:29:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164968862] [2024-11-09 01:29:05,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:29:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:29:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:29:05,508 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-09 01:29:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:05,609 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2024-11-09 01:29:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:29:05,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 28 [2024-11-09 01:29:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:05,612 INFO L225 Difference]: With dead ends: 142 [2024-11-09 01:29:05,613 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 01:29:05,613 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-09 01:29:05,614 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 99 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:05,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 151 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:29:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 01:29:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2024-11-09 01:29:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.75) internal successors, (105), 92 states have internal predecessors, (105), 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-09 01:29:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-09 01:29:05,620 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 28 [2024-11-09 01:29:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:05,620 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 01:29:05,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-09 01:29:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-09 01:29:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 01:29:05,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:05,622 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] [2024-11-09 01:29:05,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:29:05,622 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:05,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -676070898, now seen corresponding path program 1 times [2024-11-09 01:29:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417886787] [2024-11-09 01:29:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:06,195 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-09 01:29:06,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417886787] [2024-11-09 01:29:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417886787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680993234] [2024-11-09 01:29:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:29:06,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:29:06,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:29:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:06,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:29:06,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:06,426 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-09 01:29:06,478 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-09 01:29:06,552 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-11-09 01:29:06,557 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-11-09 01:29:06,590 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-11-09 01:29:06,593 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-11-09 01:29:06,663 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-09 01:29:06,689 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-09 01:29:06,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:29:06,774 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-09 01:29:06,830 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-09 01:29:06,835 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-09 01:29:07,122 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2024-11-09 01:29:07,127 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2024-11-09 01:29:07,237 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|))))) is different from false [2024-11-09 01:29:07,241 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse0 (select |v_#valid_BEFORE_CALL_75| .cse0))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|))))) is different from true [2024-11-09 01:29:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-09 01:29:07,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680993234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359569615] [2024-11-09 01:29:07,499 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 01:29:07,500 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:29:07,500 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:29:07,500 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:29:07,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:29:08,396 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:29:08,911 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:29:28,229 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3333#(and (<= 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))) (exists ((|v_#memory_int_165| (Array Int (Array Int Int))) (|v_#memory_int_164| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_164| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_164| (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_165| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_165|) (= |#memory_int| (store |v_#memory_int_165| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_165| (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)))))) (= (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))) (exists ((|v_#memory_$Pointer$.base_174| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_174| (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_174| (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_174| (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_174| (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))))) (= (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)) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_174| (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_174| (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_174| (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_174| (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)))))' at error location [2024-11-09 01:29:28,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:29:28,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-09 01:29:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264646773] [2024-11-09 01:29:28,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:29:28,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:29:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:29:28,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=939, Unknown=13, NotChecked=402, Total=1482 [2024-11-09 01:29:28,236 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 18 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (4), 1 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-09 01:29:28,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-09 01:29:28,559 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-09 01:29:28,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-09 01:29:28,569 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-09 01:29:28,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2024-11-09 01:29:28,581 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_75| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_73| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2024-11-09 01:29:28,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse0)) is different from false [2024-11-09 01:29:28,594 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse0)) is different from true [2024-11-09 01:29:28,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) .cse0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|))))) .cse0)) is different from false [2024-11-09 01:29:28,639 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (or (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) .cse0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_73| (Array Int Int)) (|v_#valid_BEFORE_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_73| |v_#valid_BEFORE_CALL_75|))) (and (= |v_#valid_BEFORE_CALL_75| (store |v_#valid_BEFORE_CALL_73| .cse1 (select |v_#valid_BEFORE_CALL_75| .cse1))) (= (select |v_#valid_BEFORE_CALL_73| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_75| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|))))) .cse0)) is different from true [2024-11-09 01:29:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:29,342 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-09 01:29:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:29:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2024-11-09 01:29:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:29,345 INFO L225 Difference]: With dead ends: 130 [2024-11-09 01:29:29,345 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 01:29:29,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=160, Invalid=1121, Unknown=23, NotChecked=858, Total=2162 [2024-11-09 01:29:29,346 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 88 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 948 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:29,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 277 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 369 Invalid, 0 Unknown, 948 Unchecked, 0.8s Time] [2024-11-09 01:29:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 01:29:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2024-11-09 01:29:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 98 states have internal predecessors, (116), 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-09 01:29:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2024-11-09 01:29:29,351 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 29 [2024-11-09 01:29:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:29,351 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2024-11-09 01:29:29,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (4), 1 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-09 01:29:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2024-11-09 01:29:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 01:29:29,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:29,353 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] [2024-11-09 01:29:29,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 01:29:29,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 01:29:29,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -676070897, now seen corresponding path program 1 times [2024-11-09 01:29:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173455073] [2024-11-09 01:29:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:30,464 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-09 01:29:30,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173455073] [2024-11-09 01:29:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173455073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837629607] [2024-11-09 01:29:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:30,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:30,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:29:30,468 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:29:30,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:29:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:30,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:29:30,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:30,734 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-09 01:29:30,826 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-09 01:29:30,851 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-09 01:29:30,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:29:30,922 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-09 01:29:30,990 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-09 01:29:31,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:29:31,057 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-09 01:29:31,245 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-09 01:29:31,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:31,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837629607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:31,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068553076] [2024-11-09 01:29:31,666 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 01:29:31,666 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:29:31,667 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:29:31,667 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:29:31,667 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:29:32,495 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:29:33,109 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:29:51,790 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3741#(and (<= 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))) (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_196| (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_196| (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_196| (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_196| (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))))) (= (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))) (<= (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) (exists ((|v_#memory_$Pointer$.offset_196| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_196| (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_196| (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_196| (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_196| (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)))) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_int_187| (Array Int (Array Int Int))) (|v_#memory_int_186| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_186| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_186| (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_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_187|) (= |#memory_int| (store |v_#memory_int_187| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_187| (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)))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 01:29:51,791 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:29:51,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2024-11-09 01:29:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253311316] [2024-11-09 01:29:51,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:29:51,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:29:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:29:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1190, Unknown=3, NotChecked=70, Total=1406 [2024-11-09 01:29:51,793 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 16 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 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-09 01:29:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:52,752 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2024-11-09 01:29:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:29:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 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 29 [2024-11-09 01:29:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:52,754 INFO L225 Difference]: With dead ends: 97 [2024-11-09 01:29:52,754 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:29:52,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=175, Invalid=1386, Unknown=3, NotChecked=76, Total=1640 [2024-11-09 01:29:52,757 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 81 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:52,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 196 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 297 Invalid, 0 Unknown, 69 Unchecked, 0.7s Time] [2024-11-09 01:29:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:29:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 01:29:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 91 states have internal predecessors, (106), 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-09 01:29:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2024-11-09 01:29:52,762 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 29 [2024-11-09 01:29:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:52,763 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2024-11-09 01:29:52,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 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-09 01:29:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2024-11-09 01:29:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 01:29:52,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:52,768 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] [2024-11-09 01:29:52,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:52,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:52,969 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 516638665, now seen corresponding path program 1 times [2024-11-09 01:29:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819248795] [2024-11-09 01:29:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:53,328 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-09 01:29:53,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819248795] [2024-11-09 01:29:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819248795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:53,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:29:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183325781] [2024-11-09 01:29:53,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:53,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:29:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:53,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:29:53,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:29:53,331 INFO L87 Difference]: Start difference. First operand 97 states and 114 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-09 01:29:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:54,033 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2024-11-09 01:29:54,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:29:54,034 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 30 [2024-11-09 01:29:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:54,034 INFO L225 Difference]: With dead ends: 117 [2024-11-09 01:29:54,034 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 01:29:54,035 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-09 01:29:54,036 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:54,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 294 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:29:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 01:29:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2024-11-09 01:29:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 92 states have internal predecessors, (107), 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-09 01:29:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2024-11-09 01:29:54,041 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 30 [2024-11-09 01:29:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:54,041 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2024-11-09 01:29:54,042 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-09 01:29:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2024-11-09 01:29:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 01:29:54,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:54,043 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] [2024-11-09 01:29:54,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:29:54,043 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:54,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash 516638666, now seen corresponding path program 1 times [2024-11-09 01:29:54,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:54,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041403901] [2024-11-09 01:29:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:54,694 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-09 01:29:54,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041403901] [2024-11-09 01:29:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041403901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:29:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008129120] [2024-11-09 01:29:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:54,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:29:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:29:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:29:54,698 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 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-09 01:29:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:55,665 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2024-11-09 01:29:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:29:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 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-09 01:29:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:55,667 INFO L225 Difference]: With dead ends: 123 [2024-11-09 01:29:55,667 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 01:29:55,668 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-09 01:29:55,668 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 59 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:55,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 354 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:29:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 01:29:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2024-11-09 01:29:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 92 states have internal predecessors, (105), 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-09 01:29:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-09 01:29:55,674 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 30 [2024-11-09 01:29:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:55,674 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 01:29:55,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 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-09 01:29:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-09 01:29:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 01:29:55,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:55,676 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] [2024-11-09 01:29:55,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:29:55,676 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:55,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1164067225, now seen corresponding path program 1 times [2024-11-09 01:29:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305032802] [2024-11-09 01:29:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:55,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:55,748 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-09 01:29:55,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305032802] [2024-11-09 01:29:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305032802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:55,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:55,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:29:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138345514] [2024-11-09 01:29:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:55,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:29:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:29:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:29:55,752 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-09 01:29:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:55,876 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2024-11-09 01:29:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:29:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 31 [2024-11-09 01:29:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:55,878 INFO L225 Difference]: With dead ends: 97 [2024-11-09 01:29:55,878 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:29:55,878 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-09 01:29:55,879 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:55,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:29:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:29:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2024-11-09 01:29:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.564516129032258) internal successors, (97), 84 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-09 01:29:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2024-11-09 01:29:55,886 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 31 [2024-11-09 01:29:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:55,886 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2024-11-09 01:29:55,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-09 01:29:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2024-11-09 01:29:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 01:29:55,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:55,888 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-09 01:29:55,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:29:55,889 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:55,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:55,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1977104792, now seen corresponding path program 1 times [2024-11-09 01:29:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629423635] [2024-11-09 01:29:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:56,696 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-09 01:29:56,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:56,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629423635] [2024-11-09 01:29:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629423635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:56,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:56,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:29:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700583757] [2024-11-09 01:29:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:56,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:29:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:29:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:29:56,702 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-09 01:29:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:57,886 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2024-11-09 01:29:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:29:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 33 [2024-11-09 01:29:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:57,887 INFO L225 Difference]: With dead ends: 105 [2024-11-09 01:29:57,887 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 01:29:57,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:29:57,888 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 53 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:57,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 386 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:29:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 01:29:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2024-11-09 01:29:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 86 states have internal predecessors, (101), 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-09 01:29:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-11-09 01:29:57,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 33 [2024-11-09 01:29:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:57,894 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-11-09 01:29:57,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-09 01:29:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-11-09 01:29:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 01:29:57,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:57,895 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-09 01:29:57,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:29:57,896 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:29:57,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1977104791, now seen corresponding path program 1 times [2024-11-09 01:29:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:57,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484807685] [2024-11-09 01:29:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:59,544 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-09 01:29:59,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484807685] [2024-11-09 01:29:59,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484807685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752122556] [2024-11-09 01:29:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:29:59,548 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:29:59,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:29:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:59,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 01:29:59,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:00,038 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-09 01:30:00,046 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-09 01:30:00,710 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:30:00,711 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-09 01:30:00,743 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-09 01:30:01,336 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 27 treesize of output 1 [2024-11-09 01:30:01,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 01:30:01,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:30:01,800 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-09 01:30:01,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:30:01,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-11-09 01:30:01,905 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-09 01:30:01,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:30:02,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:30:02,471 INFO L349 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2024-11-09 01:30:02,472 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 444 treesize of output 415 [2024-11-09 01:30:02,840 INFO L349 Elim1Store]: treesize reduction 37, result has 66.7 percent of original size [2024-11-09 01:30:02,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 820 treesize of output 747 [2024-11-09 01:30:03,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752122556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:30:03,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1258215139] [2024-11-09 01:30:03,887 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 01:30:03,887 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:30:03,887 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:30:03,888 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:30:03,888 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:30:04,837 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:30:05,249 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:30:27,370 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5013#(and (exists ((|v_#memory_$Pointer$.base_219| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_219| (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_219| (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_219| (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_219| (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|)) (exists ((|v_#memory_int_208| (Array Int (Array Int Int))) (|v_#memory_int_209| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_208| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_208| (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_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_209|) (= |#memory_int| (store |v_#memory_int_209| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_209| (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)))))) (<= 1 |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) 1) (= |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 |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) (+ 7 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4)))) (= (select |#valid| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_219| (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_219| (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_219| (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_219| (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$.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) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|)) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 01:30:27,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:30:27,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:30:27,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2024-11-09 01:30:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590339888] [2024-11-09 01:30:27,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:30:27,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 01:30:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:30:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 01:30:27,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3204, Unknown=2, NotChecked=0, Total=3422 [2024-11-09 01:30:27,373 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 30 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 4 states have call successors, (4), 2 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-09 01:30:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:30,886 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2024-11-09 01:30:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:30:30,887 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-11-09 01:30:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:30,888 INFO L225 Difference]: With dead ends: 120 [2024-11-09 01:30:30,888 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 01:30:30,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=302, Invalid=4252, Unknown=2, NotChecked=0, Total=4556 [2024-11-09 01:30:30,890 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 145 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:30,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 747 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 01:30:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 01:30:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2024-11-09 01:30:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 96 states have internal predecessors, (112), 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-09 01:30:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2024-11-09 01:30:30,896 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 33 [2024-11-09 01:30:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2024-11-09 01:30:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 4 states have call successors, (4), 2 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-09 01:30:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2024-11-09 01:30:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 01:30:30,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:30,898 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, 1] [2024-11-09 01:30:30,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:30:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:30:31,102 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:30:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1160720261, now seen corresponding path program 1 times [2024-11-09 01:30:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:30:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621320863] [2024-11-09 01:30:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:31,517 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-09 01:30:31,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:30:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621320863] [2024-11-09 01:30:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621320863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:30:31,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237043036] [2024-11-09 01:30:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:31,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:30:31,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:30:31,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:30:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:30:31,521 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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-09 01:30:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:32,149 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2024-11-09 01:30:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:30:32,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 34 [2024-11-09 01:30:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:32,151 INFO L225 Difference]: With dead ends: 134 [2024-11-09 01:30:32,151 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 01:30:32,152 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-09 01:30:32,152 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 62 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:32,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 398 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:30:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 01:30:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2024-11-09 01:30:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.528735632183908) internal successors, (133), 108 states have internal predecessors, (133), 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-09 01:30:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2024-11-09 01:30:32,158 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 34 [2024-11-09 01:30:32,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:32,158 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2024-11-09 01:30:32,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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-09 01:30:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2024-11-09 01:30:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 01:30:32,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:32,159 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:32,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:30:32,159 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:30:32,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1950778696, now seen corresponding path program 1 times [2024-11-09 01:30:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:30:32,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759079284] [2024-11-09 01:30:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 01:30:32,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:30:32,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759079284] [2024-11-09 01:30:32,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759079284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:30:32,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230087915] [2024-11-09 01:30:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:32,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:30:32,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:30:32,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:30:32,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:30:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:32,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:30:32,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 01:30:32,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:30:32,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230087915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:32,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:30:32,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 01:30:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260583238] [2024-11-09 01:30:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:32,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:30:32,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:30:32,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:30:32,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:30:32,671 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:30:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:32,767 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-09 01:30:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:30:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-09 01:30:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:32,769 INFO L225 Difference]: With dead ends: 84 [2024-11-09 01:30:32,769 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 01:30:32,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:30:32,770 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:32,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:30:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 01:30:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 01:30:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.5) internal successors, (93), 80 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-09 01:30:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2024-11-09 01:30:32,777 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 36 [2024-11-09 01:30:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:32,777 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2024-11-09 01:30:32,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:30:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2024-11-09 01:30:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:30:32,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:32,779 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, 1, 1] [2024-11-09 01:30:32,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:30:32,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:30:32,980 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:30:32,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1622083658, now seen corresponding path program 1 times [2024-11-09 01:30:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:30:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125140335] [2024-11-09 01:30:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:34,050 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-09 01:30:34,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:30:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125140335] [2024-11-09 01:30:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125140335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:30:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665334661] [2024-11-09 01:30:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:34,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:30:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:30:34,054 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:30:34,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:30:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:34,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 01:30:34,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:35,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-09 01:30:35,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:30:35,607 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2024-11-09 01:30:35,720 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-09 01:30:35,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:30:36,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:30:36,155 INFO L349 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2024-11-09 01:30:36,155 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 120 treesize of output 113 [2024-11-09 01:30:36,168 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 26 treesize of output 18 [2024-11-09 01:30:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:30:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665334661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:30:36,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [492728575] [2024-11-09 01:30:36,488 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 01:30:36,490 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:30:36,491 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:30:36,491 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:30:36,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:30:37,724 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:30:38,159 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:31:01,347 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6054#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_remove_last_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) 4)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (exists ((|v_#memory_int_239| (Array Int (Array Int Int))) (|v_#memory_int_240| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_240| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_240| (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_239| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_239| (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_240| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_240|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) 4) |ULTIMATE.start_dll_circular_remove_last_~snd_to_last~0#1.offset|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_251| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_251| (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_251| (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_251| (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_251| (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))))) (exists ((|v_#memory_$Pointer$.offset_250| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_250| (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_250| (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_250| (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_250| (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)))) (<= |#StackHeapBarrier| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) (= (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) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4)))) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0))))' at error location [2024-11-09 01:31:01,347 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:31:01,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:31:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 9] total 29 [2024-11-09 01:31:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890434677] [2024-11-09 01:31:01,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:31:01,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 01:31:01,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:31:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 01:31:01,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2751, Unknown=2, NotChecked=0, Total=2970 [2024-11-09 01:31:01,350 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 30 states, 25 states have (on average 2.8) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 01:31:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:03,061 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-09 01:31:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:31:03,062 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.8) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2024-11-09 01:31:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:03,063 INFO L225 Difference]: With dead ends: 99 [2024-11-09 01:31:03,063 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:31:03,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=274, Invalid=3384, Unknown=2, NotChecked=0, Total=3660 [2024-11-09 01:31:03,065 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 187 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:03,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 490 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 01:31:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:31:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2024-11-09 01:31:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.492063492063492) internal successors, (94), 81 states have internal predecessors, (94), 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-09 01:31:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-11-09 01:31:03,074 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2024-11-09 01:31:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:03,075 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-11-09 01:31:03,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.8) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 01:31:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-11-09 01:31:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:31:03,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:03,076 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, 1, 1] [2024-11-09 01:31:03,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:31:03,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:03,279 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:31:03,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1622589624, now seen corresponding path program 1 times [2024-11-09 01:31:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:31:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554603899] [2024-11-09 01:31:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:03,766 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-09 01:31:03,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:31:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554603899] [2024-11-09 01:31:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554603899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:03,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:31:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954033533] [2024-11-09 01:31:03,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:03,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:31:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:31:03,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:31:03,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:31:03,768 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 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-09 01:31:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:04,382 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2024-11-09 01:31:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:31:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 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-09 01:31:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:04,384 INFO L225 Difference]: With dead ends: 98 [2024-11-09 01:31:04,384 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:31:04,384 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-09 01:31:04,385 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:04,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 300 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:31:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:31:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-09 01:31:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 84 states have internal predecessors, (97), 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-09 01:31:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2024-11-09 01:31:04,389 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 35 [2024-11-09 01:31:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:04,390 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2024-11-09 01:31:04,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 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-09 01:31:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2024-11-09 01:31:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 01:31:04,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:04,391 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, 1, 1, 1] [2024-11-09 01:31:04,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 01:31:04,391 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:31:04,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1239329309, now seen corresponding path program 1 times [2024-11-09 01:31:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:31:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718449220] [2024-11-09 01:31:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:04,545 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-09 01:31:04,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:31:04,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718449220] [2024-11-09 01:31:04,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718449220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:04,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:04,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:31:04,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541280416] [2024-11-09 01:31:04,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:04,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:31:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:31:04,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:31:04,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:31:04,547 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-09 01:31:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:04,870 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2024-11-09 01:31:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:31:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 36 [2024-11-09 01:31:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:04,871 INFO L225 Difference]: With dead ends: 87 [2024-11-09 01:31:04,871 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 01:31:04,872 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-09 01:31:04,872 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:04,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 128 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:31:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 01:31:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 01:31:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 83 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-09 01:31:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-11-09 01:31:04,880 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 36 [2024-11-09 01:31:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:04,881 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-09 01:31:04,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-09 01:31:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-11-09 01:31:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 01:31:04,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:04,885 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, 1, 1, 1, 1] [2024-11-09 01:31:04,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 01:31:04,885 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:31:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 250736825, now seen corresponding path program 1 times [2024-11-09 01:31:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:31:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955213829] [2024-11-09 01:31:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:05,226 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-09 01:31:05,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:31:05,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955213829] [2024-11-09 01:31:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955213829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:05,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:05,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:31:05,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467823196] [2024-11-09 01:31:05,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:05,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:31:05,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:31:05,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:31:05,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:31:05,230 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-09 01:31:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:05,594 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-11-09 01:31:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:31:05,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 37 [2024-11-09 01:31:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:05,596 INFO L225 Difference]: With dead ends: 86 [2024-11-09 01:31:05,596 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 01:31:05,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:31:05,596 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 102 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:05,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 99 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:31:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 01:31:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 01:31:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 82 states have internal predecessors, (94), 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-09 01:31:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-11-09 01:31:05,601 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 37 [2024-11-09 01:31:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:05,601 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-09 01:31:05,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-09 01:31:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-11-09 01:31:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 01:31:05,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:05,602 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, 1, 1, 1, 1] [2024-11-09 01:31:05,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 01:31:05,603 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:31:05,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash -235496981, now seen corresponding path program 1 times [2024-11-09 01:31:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:31:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63313406] [2024-11-09 01:31:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:05,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:31:06,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:31:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63313406] [2024-11-09 01:31:06,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63313406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497774195] [2024-11-09 01:31:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:31:06,238 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:31:06,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 01:31:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:06,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:31:06,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:06,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:31:06,786 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-09 01:31:06,791 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-09 01:31:06,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:06,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497774195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:06,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:31:06,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2024-11-09 01:31:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209560757] [2024-11-09 01:31:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:06,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:31:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:31:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:31:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:31:06,793 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-09 01:31:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:07,083 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-09 01:31:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:31:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 37 [2024-11-09 01:31:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:07,084 INFO L225 Difference]: With dead ends: 85 [2024-11-09 01:31:07,084 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 01:31:07,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:31:07,085 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 89 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:07,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 88 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:31:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 01:31:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 01:31:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.393939393939394) internal successors, (92), 81 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-09 01:31:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-09 01:31:07,089 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 37 [2024-11-09 01:31:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:07,090 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-09 01:31:07,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-09 01:31:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-09 01:31:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:31:07,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:07,091 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, 1, 1, 1, 1, 1] [2024-11-09 01:31:07,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 01:31:07,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 01:31:07,292 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:31:07,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash -817092957, now seen corresponding path program 1 times [2024-11-09 01:31:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:31:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207640714] [2024-11-09 01:31:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:08,295 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-09 01:31:08,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:31:08,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207640714] [2024-11-09 01:31:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207640714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:31:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65152051] [2024-11-09 01:31:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:31:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:31:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:31:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:31:08,297 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 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-09 01:31:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:09,451 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-11-09 01:31:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:31:09,452 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 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 38 [2024-11-09 01:31:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:09,453 INFO L225 Difference]: With dead ends: 90 [2024-11-09 01:31:09,453 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 01:31:09,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:31:09,454 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:09,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 303 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:31:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 01:31:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-11-09 01:31:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.391304347826087) internal successors, (96), 84 states have internal predecessors, (96), 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-09 01:31:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-11-09 01:31:09,459 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 38 [2024-11-09 01:31:09,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:09,459 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-11-09 01:31:09,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 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-09 01:31:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-11-09 01:31:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:31:09,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:09,461 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, 1, 1, 1, 1, 1] [2024-11-09 01:31:09,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 01:31:09,461 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:31:09,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash -817092956, now seen corresponding path program 1 times [2024-11-09 01:31:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:31:09,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323248425] [2024-11-09 01:31:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:09,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:10,193 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-09 01:31:10,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:31:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323248425] [2024-11-09 01:31:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323248425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:31:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449252380] [2024-11-09 01:31:10,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:31:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:31:10,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:31:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:31:10,196 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-09 01:31:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:10,870 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-11-09 01:31:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:31:10,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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 38 [2024-11-09 01:31:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:10,871 INFO L225 Difference]: With dead ends: 90 [2024-11-09 01:31:10,871 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 01:31:10,872 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-09 01:31:10,872 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:10,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 312 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:31:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 01:31:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-11-09 01:31:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 84 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-09 01:31:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-11-09 01:31:10,877 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 38 [2024-11-09 01:31:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:10,877 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-11-09 01:31:10,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-09 01:31:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-11-09 01:31:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:31:10,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:10,879 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:10,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 01:31:10,879 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:31:10,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 752748968, now seen corresponding path program 1 times [2024-11-09 01:31:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:31:10,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858314606] [2024-11-09 01:31:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:10,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:12,866 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-09 01:31:12,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:31:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858314606] [2024-11-09 01:31:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858314606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405715962] [2024-11-09 01:31:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:12,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:31:12,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:31:12,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 01:31:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:13,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-09 01:31:13,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:13,274 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-09 01:31:14,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:31:14,107 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-09 01:31:14,467 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-09 01:31:14,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:31:14,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:31:14,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:31:14,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 45 [2024-11-09 01:31:15,710 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-09 01:31:16,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:31:16,311 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-09 01:31:16,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 23 [2024-11-09 01:31:16,323 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-09 01:31:16,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:16,346 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 01:31:16,346 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 12 treesize of output 11 [2024-11-09 01:31:16,792 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 74 treesize of output 66 [2024-11-09 01:31:18,158 INFO L349 Elim1Store]: treesize reduction 48, result has 77.4 percent of original size [2024-11-09 01:31:18,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 57108 treesize of output 46251 [2024-11-09 01:31:54,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405715962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [365840178] [2024-11-09 01:31:54,135 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 01:31:54,135 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:31:54,135 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:31:54,136 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:31:54,136 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:31:55,092 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:31:55,471 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:32:47,288 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7779#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_280| (Array Int (Array Int Int))) (|v_#memory_int_264| (Array Int (Array Int Int))) (|v_#memory_int_265| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_274| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_278| (Array Int (Array Int Int))) (|v_#valid_192| (Array Int Int)) (|v_#memory_int_263| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |ULTIMATE.start_dll_circular_remove_last_~snd_to_last~0#1.offset|))) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select (store (store |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4) |ULTIMATE.start_dll_circular_remove_last_~snd_to_last~0#1.offset|) (= |#memory_int| (store |v_#memory_int_265| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_265| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store (store |v_#memory_$Pointer$.base_278| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_278| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_278| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_278| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_$Pointer$.base_280|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4)))) (= (select |v_#valid_192| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (not (= (select |#valid| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4)) 1)) (= (store |v_#memory_int_263| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_263| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_264| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_264|) (= (select (select (store (store |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_274| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (store |v_#valid_192| (select (select |v_#memory_$Pointer$.base_280| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0) |#valid|) (= (store |v_#memory_int_264| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_264| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_265| (select (select |v_#memory_$Pointer$.base_280| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_265|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 01:32:47,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:32:47,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:32:47,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2024-11-09 01:32:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109123133] [2024-11-09 01:32:47,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:32:47,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 01:32:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:32:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 01:32:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=6114, Unknown=12, NotChecked=0, Total=6480 [2024-11-09 01:32:47,291 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 41 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 4 states have call successors, (4), 2 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-09 01:32:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:50,533 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2024-11-09 01:32:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 01:32:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2024-11-09 01:32:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:50,534 INFO L225 Difference]: With dead ends: 92 [2024-11-09 01:32:50,534 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 01:32:50,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=494, Invalid=8050, Unknown=12, NotChecked=0, Total=8556 [2024-11-09 01:32:50,538 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 94 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:50,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 660 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 01:32:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 01:32:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-09 01:32:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.380281690140845) internal successors, (98), 86 states have internal predecessors, (98), 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-09 01:32:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2024-11-09 01:32:50,541 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 40 [2024-11-09 01:32:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:50,542 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2024-11-09 01:32:50,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 4 states have call successors, (4), 2 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-09 01:32:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2024-11-09 01:32:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:32:50,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:50,543 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:50,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:50,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:32:50,744 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:32:50,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash 752748969, now seen corresponding path program 1 times [2024-11-09 01:32:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:32:50,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899484589] [2024-11-09 01:32:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,254 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-09 01:32:54,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:32:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899484589] [2024-11-09 01:32:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899484589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324875910] [2024-11-09 01:32:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:32:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:32:54,256 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:32:54,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 01:32:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-09 01:32:54,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:54,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 5 [2024-11-09 01:32:55,263 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-09 01:32:55,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:32:55,544 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-09 01:32:55,913 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-09 01:32:55,934 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-09 01:32:56,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:32:56,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:32:56,498 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 01:32:56,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 52 [2024-11-09 01:32:56,529 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 47 treesize of output 24 [2024-11-09 01:32:57,537 INFO L349 Elim1Store]: treesize reduction 38, result has 33.3 percent of original size [2024-11-09 01:32:57,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 31 [2024-11-09 01:32:58,038 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-09 01:32:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 25 [2024-11-09 01:32:58,185 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-09 01:32:58,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:04,344 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-11-09 01:33:04,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 42 [2024-11-09 01:33:04,374 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 348 treesize of output 340 [2024-11-09 01:33:04,572 INFO L349 Elim1Store]: treesize reduction 13, result has 80.9 percent of original size [2024-11-09 01:33:04,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2024-11-09 01:33:04,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:04,606 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 30 treesize of output 34 [2024-11-09 01:33:05,465 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-11-09 01:33:05,465 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 114 [2024-11-09 01:33:05,478 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:33:05,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:05,523 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 446 treesize of output 445 [2024-11-09 01:33:05,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:33:05,688 INFO L349 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2024-11-09 01:33:05,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 111 [2024-11-09 01:33:05,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-09 01:33:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324875910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270511374] [2024-11-09 01:33:07,036 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 01:33:07,037 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:33:07,037 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:33:07,037 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:33:07,037 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:33:07,920 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:33:08,332 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:34:01,368 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8258#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|) (exists ((|v_#memory_$Pointer$.base_307| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_305| (Array Int (Array Int Int))) (|v_#memory_int_287| (Array Int (Array Int Int))) (|v_#valid_204| (Array Int Int)) (|v_#memory_int_288| (Array Int (Array Int Int))) (|v_#memory_int_289| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_301| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_305| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_305| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_305| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_305| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_$Pointer$.base_307|) (= (select (select (store (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (store |v_#valid_204| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0) |#valid|) (= |v_#memory_int_288| (store |v_#memory_int_287| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_287| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_288| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select (store (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4)))) (= |#memory_int| (store |v_#memory_int_289| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_289| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_#valid_204| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_288| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_288| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_289| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_289|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= (+ (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4))) |#memory_$Pointer$.base|) (or (< (select |#length| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4) 4)) (< (select (select (store (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_301| (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) (select (select |v_#memory_$Pointer$.base_307| (select (select |v_#memory_$Pointer$.base_307| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 4) 0)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 01:34:01,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:34:01,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:34:01,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2024-11-09 01:34:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927387823] [2024-11-09 01:34:01,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:34:01,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 01:34:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:34:01,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 01:34:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=7148, Unknown=14, NotChecked=0, Total=7482 [2024-11-09 01:34:01,372 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 44 states, 38 states have (on average 1.894736842105263) internal successors, (72), 38 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:34:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:07,620 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-11-09 01:34:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 01:34:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 1.894736842105263) internal successors, (72), 38 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2024-11-09 01:34:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:07,621 INFO L225 Difference]: With dead ends: 92 [2024-11-09 01:34:07,621 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 01:34:07,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 67.5s TimeCoverageRelationStatistics Valid=551, Invalid=10991, Unknown=14, NotChecked=0, Total=11556 [2024-11-09 01:34:07,626 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 120 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:07,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 723 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 01:34:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 01:34:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-09 01:34:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 86 states have internal predecessors, (97), 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-09 01:34:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2024-11-09 01:34:07,630 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 40 [2024-11-09 01:34:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:07,630 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2024-11-09 01:34:07,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 1.894736842105263) internal successors, (72), 38 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:34:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2024-11-09 01:34:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:34:07,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:07,632 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:07,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 01:34:07,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:07,833 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:34:07,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2008895041, now seen corresponding path program 1 times [2024-11-09 01:34:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:34:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378004382] [2024-11-09 01:34:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 01:34:07,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:07,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378004382] [2024-11-09 01:34:07,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378004382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:07,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:07,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:34:07,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934364687] [2024-11-09 01:34:07,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:07,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:07,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:34:07,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:07,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:07,969 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-09 01:34:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:08,157 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-09 01:34:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:34:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 40 [2024-11-09 01:34:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:08,159 INFO L225 Difference]: With dead ends: 88 [2024-11-09 01:34:08,159 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 01:34:08,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:08,160 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:08,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 77 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 01:34:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 01:34:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.323943661971831) internal successors, (94), 84 states have internal predecessors, (94), 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-09 01:34:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-09 01:34:08,168 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 40 [2024-11-09 01:34:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:08,168 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-09 01:34:08,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-09 01:34:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-09 01:34:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 01:34:08,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:08,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:08,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 01:34:08,170 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:34:08,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2107815829, now seen corresponding path program 1 times [2024-11-09 01:34:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:34:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047593900] [2024-11-09 01:34:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 01:34:08,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:08,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047593900] [2024-11-09 01:34:08,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047593900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527173057] [2024-11-09 01:34:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:08,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:08,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:34:08,338 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:34:08,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 01:34:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:08,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:34:08,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 01:34:08,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 01:34:08,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527173057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:34:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [466860325] [2024-11-09 01:34:08,999 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-09 01:34:08,999 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:34:09,000 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:34:09,000 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:34:09,000 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:34:12,309 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:34:12,808 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:34:43,325 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 247 DAG size of output: 219 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:36:44,057 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8951#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|))) (exists ((|v_ULTIMATE.start_main_~len~0#1_13| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_19| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_19| Int) (|v_#valid_221| (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_30| Int)) (and (<= 1 |#StackHeapBarrier|) (= 0 |v_ULTIMATE.start_main_~#s~0#1.offset_19|) (= |v_ULTIMATE.start_main_~len~0#1_13| 2) (<= 2 |v_ULTIMATE.start_main_~#s~0#1.base_19|) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#s~0#1.base_19|)) (= (select |v_#valid_221| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 1) (= (store |v_#valid_221| |v_ULTIMATE.start_main_~#s~0#1.base_19| 0) |#valid|) (exists ((|v_#valid_220| (Array Int Int)) (|v_#memory_$Pointer$.offset_335| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_21| Int) (|v_#memory_$Pointer$.base_339| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36| Int) (|v_#memory_int_321| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_321| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36| (store (select |v_#memory_int_321| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0)))) (= 1 (select |v_#valid_220| (select (select |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_335| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36| (store (select |v_#memory_$Pointer$.offset_335| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0 0))) (= |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36| |v_ULTIMATE.start_main_~#s~0#1.base_19|) (= |v_ULTIMATE.start_main_~i~0#1_30| 2) (= (store |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36| (store (select |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0 0)) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.base_339| (select (select |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0)) 4) (select (select |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0)) (exists ((|v_#memory_int_317| (Array Int (Array Int Int))) (|v_#memory_int_319| (Array Int (Array Int Int))) (|v_#memory_int_318| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_337| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int))) (|v_#valid_218| (Array Int Int))) (and (= (select |v_#valid_218| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 1) (= (store (store |v_#memory_$Pointer$.base_335| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.base_335| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0))) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) (store (select (store |v_#memory_$Pointer$.base_335| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.base_335| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0))) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4 (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4))) |v_#memory_$Pointer$.base_337|) (= (store (store (store |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) (store (select (store |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4 0)) |v_ULTIMATE.start_main_~#s~0#1.base_19| (store (select (store (store |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) (store (select (store |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4 0)) |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0 0)) |v_#memory_$Pointer$.offset_335|) (= (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) (= (select (select (store (store |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) (store (select (store |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_331| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 0)) (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4 0)) |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) 0) (= (store |v_#memory_int_318| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) (store (select |v_#memory_int_318| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4 (select (select |v_#memory_int_319| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4))) |v_#memory_int_319|) (<= (+ (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) 1) |#StackHeapBarrier|) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0))) (= (store |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19| (store (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0 0)) |v_#memory_$Pointer$.base_339|) (= (store |v_#memory_int_319| |v_ULTIMATE.start_main_~#s~0#1.base_19| (store (select |v_#memory_int_319| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0 (select (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0))) |v_#memory_int_321|) (= (store |v_#memory_int_317| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4) (store (select |v_#memory_int_317| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0 (select (select |v_#memory_int_318| (select (select |v_#memory_$Pointer$.base_337| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0)) 4)) 0))) |v_#memory_int_318|) (= |v_#valid_220| (store |v_#valid_218| (select (select |v_#memory_$Pointer$.base_337| |v_ULTIMATE.start_main_~#s~0#1.base_19|) 0) 0)))) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0))) (= (select (select |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0) |v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_21|) (= (store |v_#valid_220| |v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_21| 0) |v_#valid_221|) (= (select (select |v_#memory_$Pointer$.offset_335| (select (select |v_#memory_$Pointer$.base_339| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_36|) 0)) 4) 0))))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 01:36:44,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:36:44,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:36:44,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 01:36:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160013490] [2024-11-09 01:36:44,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:36:44,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:36:44,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:36:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:36:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1343, Unknown=31, NotChecked=0, Total=1560 [2024-11-09 01:36:44,061 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:36:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:44,217 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-09 01:36:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:44,218 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-11-09 01:36:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:44,219 INFO L225 Difference]: With dead ends: 94 [2024-11-09 01:36:44,219 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 01:36:44,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 151.3s TimeCoverageRelationStatistics Valid=186, Invalid=1343, Unknown=31, NotChecked=0, Total=1560 [2024-11-09 01:36:44,220 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:44,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 149 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 01:36:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 01:36:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 90 states have internal predecessors, (98), 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-09 01:36:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2024-11-09 01:36:44,224 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 42 [2024-11-09 01:36:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:44,224 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2024-11-09 01:36:44,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:36:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-11-09 01:36:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 01:36:44,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:44,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:44,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:44,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:44,427 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:36:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2109660091, now seen corresponding path program 1 times [2024-11-09 01:36:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:36:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895799171] [2024-11-09 01:36:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:36:48,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:36:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895799171] [2024-11-09 01:36:48,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895799171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386230625] [2024-11-09 01:36:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:48,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:48,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:36:48,899 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:48,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 01:36:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:49,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 01:36:49,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:49,214 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-09 01:36:50,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:36:50,061 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-09 01:36:50,750 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 27 treesize of output 1 [2024-11-09 01:36:52,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 29 treesize of output 21 [2024-11-09 01:36:52,379 INFO L349 Elim1Store]: treesize reduction 21, result has 40.0 percent of original size [2024-11-09 01:36:52,379 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 34 treesize of output 24 [2024-11-09 01:36:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:36:52,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:53,665 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 8 treesize of output 4 [2024-11-09 01:36:53,979 INFO L349 Elim1Store]: treesize reduction 11, result has 64.5 percent of original size [2024-11-09 01:36:53,980 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 133 treesize of output 124 [2024-11-09 01:36:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:36:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386230625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:36:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720516275] [2024-11-09 01:36:56,411 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-09 01:36:56,411 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:36:56,411 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:36:56,412 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:36:56,412 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:37:02,412 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:37:02,839 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:38:59,965 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9471#(and (= |ULTIMATE.start_dll_circular_remove_last_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) |ULTIMATE.start_dll_circular_remove_last_~head#1.offset|)) (exists ((|v_#memory_int_359| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_remove_last_~head#1.offset_35| Int) (|v_#memory_$Pointer$.offset_373| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_378| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42| Int)) (and (<= 1 |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_378| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42| (store (select |v_#memory_$Pointer$.base_378| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42|) 0 0))) (= |v_ULTIMATE.start_dll_circular_remove_last_~head#1.offset_35| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select |#valid| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#memory_int| (store |v_#memory_int_359| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42| (store (select |v_#memory_int_359| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42|) 0)))) (<= 2 |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_373| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42| (store (select |v_#memory_$Pointer$.offset_373| |v_ULTIMATE.start_dll_circular_remove_last_~head#1.base_42|) 0 0))))) (= (select |#valid| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (exists ((|v_#valid_242| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_28| Int)) (and (= |#valid| (store |v_#valid_242| |v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_28| 0)) (<= (+ |v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_28| 1) |#StackHeapBarrier|) (or (= |v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_28| 0) (= (select |v_#valid_242| |v_ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base_28|) 1)))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) |ULTIMATE.start_dll_circular_remove_last_~head#1.offset|)) 1)) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|)) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2024-11-09 01:38:59,965 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:38:59,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:38:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 19] total 56 [2024-11-09 01:38:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164503437] [2024-11-09 01:38:59,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:38:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-09 01:38:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:38:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-09 01:38:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=6420, Unknown=88, NotChecked=0, Total=6806 [2024-11-09 01:38:59,968 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 56 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 01:39:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:18,369 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2024-11-09 01:39:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:39:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-11-09 01:39:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:18,371 INFO L225 Difference]: With dead ends: 77 [2024-11-09 01:39:18,371 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 01:39:18,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2263 ImplicationChecksByTransitivity, 136.9s TimeCoverageRelationStatistics Valid=467, Invalid=9145, Unknown=90, NotChecked=0, Total=9702 [2024-11-09 01:39:18,372 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:18,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 765 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-09 01:39:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 01:39:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 01:39:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 71 states have internal predecessors, (73), 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-09 01:39:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-11-09 01:39:18,375 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 42 [2024-11-09 01:39:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:18,375 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-09 01:39:18,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 01:39:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-11-09 01:39:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 01:39:18,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:18,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:18,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 01:39:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:39:18,581 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:39:18,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 339910795, now seen corresponding path program 1 times [2024-11-09 01:39:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:39:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678438962] [2024-11-09 01:39:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:39:22,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:39:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678438962] [2024-11-09 01:39:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678438962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659467582] [2024-11-09 01:39:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:22,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:39:22,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:39:22,328 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:39:22,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 01:39:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-09 01:39:22,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:22,924 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-09 01:39:22,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 01:39:23,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 5 treesize of output 3 [2024-11-09 01:39:23,283 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-09 01:39:24,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:24,258 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-09 01:39:24,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:24,290 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 12 treesize of output 14 [2024-11-09 01:39:26,182 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:39:26,183 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-09 01:39:26,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:26,372 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 01:39:26,373 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 16 treesize of output 18 [2024-11-09 01:39:27,369 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-09 01:39:28,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:39:28,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-11-09 01:39:28,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-09 01:39:34,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:39:34,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:34,437 INFO L349 Elim1Store]: treesize reduction 80, result has 12.1 percent of original size [2024-11-09 01:39:34,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 206 treesize of output 124 [2024-11-09 01:39:34,491 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 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 01:39:34,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:34,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2024-11-09 01:39:35,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:35,980 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 01:39:35,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2024-11-09 01:39:36,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:36,217 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2024-11-09 01:39:36,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2024-11-09 01:39:36,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:36,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 01:39:37,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:37,474 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:39:37,474 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 2 case distinctions, treesize of input 51 treesize of output 23 [2024-11-09 01:39:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:39:37,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:38,373 INFO L349 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2024-11-09 01:39:38,373 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 58 treesize of output 57 [2024-11-09 01:39:42,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:39:43,001 INFO L349 Elim1Store]: treesize reduction 230, result has 13.9 percent of original size [2024-11-09 01:39:43,002 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 9 new quantified variables, introduced 15 case distinctions, treesize of input 14964 treesize of output 13032 [2024-11-09 01:39:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:39:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659467582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:39:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [764906330] [2024-11-09 01:39:50,748 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-09 01:39:50,748 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:39:50,748 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:39:50,749 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:39:50,749 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:39:52,207 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 01:39:52,727 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:40:55,912 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10013#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) |ULTIMATE.start_dll_circular_remove_last_#t~mem7#1.offset|) (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) 1)) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|)) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 01:40:55,913 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:40:55,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:40:55,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 23] total 66 [2024-11-09 01:40:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236824605] [2024-11-09 01:40:55,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:40:55,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-09 01:40:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:40:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-09 01:40:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=8882, Unknown=8, NotChecked=0, Total=9702 [2024-11-09 01:40:55,917 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 67 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 58 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:41:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:20,284 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-09 01:41:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 01:41:20,285 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 58 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2024-11-09 01:41:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:20,286 INFO L225 Difference]: With dead ends: 127 [2024-11-09 01:41:20,286 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 01:41:20,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6696 ImplicationChecksByTransitivity, 96.5s TimeCoverageRelationStatistics Valid=1809, Invalid=17365, Unknown=8, NotChecked=0, Total=19182 [2024-11-09 01:41:20,289 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 483 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:20,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 678 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-09 01:41:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 01:41:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 80. [2024-11-09 01:41:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 76 states have internal predecessors, (80), 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-09 01:41:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-09 01:41:20,293 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 45 [2024-11-09 01:41:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:20,294 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-09 01:41:20,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 58 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:41:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-09 01:41:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 01:41:20,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:20,295 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:20,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 01:41:20,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:41:20,496 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 01:41:20,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash 339910796, now seen corresponding path program 1 times [2024-11-09 01:41:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:41:20,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819064433] [2024-11-09 01:41:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:41:24,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:41:24,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819064433] [2024-11-09 01:41:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819064433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:41:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081213184] [2024-11-09 01:41:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:24,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:41:24,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:41:24,055 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:41:24,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2575e146-492e-4bee-8858-323736615009/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 01:41:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:24,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-09 01:41:24,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:41:24,703 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-09 01:41:25,528 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:41:25,529 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-09 01:41:26,201 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-09 01:41:26,882 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 01:41:26,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 01:41:27,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:41:28,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:41:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:41:29,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:41:29,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 45