./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:25:34,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:25:34,274 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:25:34,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:25:34,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:25:34,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:25:34,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:25:34,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:25:34,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:25:34,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:25:34,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:25:34,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:25:34,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:25:34,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:25:34,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:25:34,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:25:34,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:25:34,312 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:25:34,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:25:34,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:25:34,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:25:34,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:25:34,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:25:34,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:25:34,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:25:34,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:34,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:25:34,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:25:34,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:25:34,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:25:34,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:34,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:25:34,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:25:34,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:25:34,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:25:34,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:25:34,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:25:34,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:25:34,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:25:34,315 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2024-11-28 05:25:34,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:25:34,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:25:34,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:25:34,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:25:34,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:25:34,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2024-11-28 05:25:37,608 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/data/3b8b0cf89/0ff20f6f1f684d5daa80e98039d4d89b/FLAG7403496b1 [2024-11-28 05:25:37,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:25:37,930 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2024-11-28 05:25:37,949 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/data/3b8b0cf89/0ff20f6f1f684d5daa80e98039d4d89b/FLAG7403496b1 [2024-11-28 05:25:37,972 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/data/3b8b0cf89/0ff20f6f1f684d5daa80e98039d4d89b [2024-11-28 05:25:37,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:25:37,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:25:37,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:25:37,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:25:37,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:25:37,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:37" (1/1) ... [2024-11-28 05:25:37,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10eb664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:37, skipping insertion in model container [2024-11-28 05:25:37,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:37" (1/1) ... [2024-11-28 05:25:38,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:25:38,346 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:25:38,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:25:38,376 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:25:38,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:25:38,447 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:25:38,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38 WrapperNode [2024-11-28 05:25:38,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:25:38,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:25:38,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:25:38,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:25:38,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,487 INFO L138 Inliner]: procedures = 124, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 165 [2024-11-28 05:25:38,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:25:38,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:25:38,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:25:38,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:25:38,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,524 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 34, 1]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 17 writes are split as follows [0, 16, 1]. [2024-11-28 05:25:38,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:25:38,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:25:38,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:25:38,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:25:38,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (1/1) ... [2024-11-28 05:25:38,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:38,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:25:38,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 05:25:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:25:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:25:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:25:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 05:25:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:25:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:25:38,748 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:25:38,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:25:39,407 INFO L? ?]: Removed 184 outVars from TransFormulas that were not future-live. [2024-11-28 05:25:39,407 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:25:39,440 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:25:39,440 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 05:25:39,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:39 BoogieIcfgContainer [2024-11-28 05:25:39,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:25:39,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:25:39,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:25:39,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:25:39,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:25:37" (1/3) ... [2024-11-28 05:25:39,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6911cb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:39, skipping insertion in model container [2024-11-28 05:25:39,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:38" (2/3) ... [2024-11-28 05:25:39,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6911cb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:39, skipping insertion in model container [2024-11-28 05:25:39,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:39" (3/3) ... [2024-11-28 05:25:39,453 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2024-11-28 05:25:39,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:25:39,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_dsw.i that has 1 procedures, 163 locations, 1 initial locations, 4 loop locations, and 77 error locations. [2024-11-28 05:25:39,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:25:39,559 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@fd8e935, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:25:39,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-28 05:25:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 85 states have (on average 2.1176470588235294) internal successors, (180), 162 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:25:39,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:39,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:25:39,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:39,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 05:25:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299246523] [2024-11-28 05:25:39,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:39,801 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-28 05:25:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299246523] [2024-11-28 05:25:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299246523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:39,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:25:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171604680] [2024-11-28 05:25:39,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:39,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:39,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:39,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:39,857 INFO L87 Difference]: Start difference. First operand has 163 states, 85 states have (on average 2.1176470588235294) internal successors, (180), 162 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:40,116 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2024-11-28 05:25:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:25:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:40,129 INFO L225 Difference]: With dead ends: 161 [2024-11-28 05:25:40,129 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 05:25:40,131 INFO L434 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-28 05:25:40,136 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 108 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:40,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 145 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 05:25:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-28 05:25:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 84 states have (on average 2.0476190476190474) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2024-11-28 05:25:40,192 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 3 [2024-11-28 05:25:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:40,193 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2024-11-28 05:25:40,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2024-11-28 05:25:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:25:40,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:40,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:25:40,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:25:40,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:40,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 05:25:40,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:40,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185131490] [2024-11-28 05:25:40,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:40,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:40,334 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-28 05:25:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185131490] [2024-11-28 05:25:40,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185131490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:40,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:40,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:25:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276107229] [2024-11-28 05:25:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:40,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:40,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:40,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:40,337 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:40,534 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2024-11-28 05:25:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:25:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:40,536 INFO L225 Difference]: With dead ends: 157 [2024-11-28 05:25:40,536 INFO L226 Difference]: Without dead ends: 157 [2024-11-28 05:25:40,537 INFO L434 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-28 05:25:40,538 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 108 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:40,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 148 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-28 05:25:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-28 05:25:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 84 states have (on average 2.0238095238095237) internal successors, (170), 156 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2024-11-28 05:25:40,560 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 3 [2024-11-28 05:25:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:40,560 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2024-11-28 05:25:40,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2024-11-28 05:25:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 05:25:40,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:40,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:40,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:25:40,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:40,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 59353998, now seen corresponding path program 1 times [2024-11-28 05:25:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:40,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476236259] [2024-11-28 05:25:40,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:40,713 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-28 05:25:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476236259] [2024-11-28 05:25:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476236259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:40,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:40,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:25:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027384399] [2024-11-28 05:25:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:40,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:40,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:40,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:40,714 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:41,058 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2024-11-28 05:25:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 05:25:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:41,061 INFO L225 Difference]: With dead ends: 146 [2024-11-28 05:25:41,061 INFO L226 Difference]: Without dead ends: 146 [2024-11-28 05:25:41,061 INFO L434 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-28 05:25:41,062 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 168 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:41,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 116 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:25:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-28 05:25:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-28 05:25:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.8160919540229885) internal successors, (158), 141 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2024-11-28 05:25:41,082 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 8 [2024-11-28 05:25:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:41,082 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2024-11-28 05:25:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2024-11-28 05:25:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 05:25:41,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:41,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:41,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:25:41,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:41,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash 59353999, now seen corresponding path program 1 times [2024-11-28 05:25:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:41,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505712285] [2024-11-28 05:25:41,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:41,308 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-28 05:25:41,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:41,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505712285] [2024-11-28 05:25:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505712285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:25:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613824725] [2024-11-28 05:25:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:41,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:41,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:41,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:41,313 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:41,645 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2024-11-28 05:25:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:25:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 05:25:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:41,647 INFO L225 Difference]: With dead ends: 189 [2024-11-28 05:25:41,648 INFO L226 Difference]: Without dead ends: 189 [2024-11-28 05:25:41,649 INFO L434 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-28 05:25:41,650 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 192 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:41,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 183 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:25:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-28 05:25:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2024-11-28 05:25:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.6666666666666667) internal successors, (205), 177 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-11-28 05:25:41,659 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 8 [2024-11-28 05:25:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:41,659 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-11-28 05:25:41,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-11-28 05:25:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:25:41,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:41,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:41,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:25:41,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:41,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1209947509, now seen corresponding path program 1 times [2024-11-28 05:25:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:41,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326989597] [2024-11-28 05:25:41,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:41,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:41,772 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-28 05:25:41,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326989597] [2024-11-28 05:25:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326989597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:41,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:41,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:25:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125365340] [2024-11-28 05:25:41,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:41,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:25:41,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:41,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:25:41,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:41,775 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:41,953 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2024-11-28 05:25:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:25:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:41,955 INFO L225 Difference]: With dead ends: 179 [2024-11-28 05:25:41,956 INFO L226 Difference]: Without dead ends: 179 [2024-11-28 05:25:41,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:41,957 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 109 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:41,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 417 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:25:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-28 05:25:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-28 05:25:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 124 states have (on average 1.6612903225806452) internal successors, (206), 178 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2024-11-28 05:25:41,967 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 10 [2024-11-28 05:25:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:41,968 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2024-11-28 05:25:41,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2024-11-28 05:25:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 05:25:41,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:41,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:25:41,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1146327748, now seen corresponding path program 1 times [2024-11-28 05:25:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491314067] [2024-11-28 05:25:41,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:42,119 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-28 05:25:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491314067] [2024-11-28 05:25:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491314067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:42,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384745675] [2024-11-28 05:25:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:42,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:42,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:42,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:42,121 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:42,341 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2024-11-28 05:25:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:25:42,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 05:25:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:42,343 INFO L225 Difference]: With dead ends: 179 [2024-11-28 05:25:42,343 INFO L226 Difference]: Without dead ends: 179 [2024-11-28 05:25:42,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:42,344 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 105 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:42,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 209 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-28 05:25:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2024-11-28 05:25:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.6585365853658536) internal successors, (204), 177 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2024-11-28 05:25:42,360 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 11 [2024-11-28 05:25:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:42,360 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2024-11-28 05:25:42,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2024-11-28 05:25:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 05:25:42,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:42,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:42,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:25:42,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:42,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -675554533, now seen corresponding path program 1 times [2024-11-28 05:25:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:42,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037656477] [2024-11-28 05:25:42,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:42,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:42,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037656477] [2024-11-28 05:25:42,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037656477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:42,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:42,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:25:42,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19127173] [2024-11-28 05:25:42,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:42,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:42,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:42,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:42,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:42,432 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:42,449 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2024-11-28 05:25:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:42,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 05:25:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:42,450 INFO L225 Difference]: With dead ends: 180 [2024-11-28 05:25:42,451 INFO L226 Difference]: Without dead ends: 180 [2024-11-28 05:25:42,451 INFO L434 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-28 05:25:42,452 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:42,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:25:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-28 05:25:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-28 05:25:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 125 states have (on average 1.648) internal successors, (206), 179 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2024-11-28 05:25:42,469 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 16 [2024-11-28 05:25:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:42,470 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2024-11-28 05:25:42,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2024-11-28 05:25:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 05:25:42,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:42,471 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:42,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:25:42,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:42,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1725197507, now seen corresponding path program 1 times [2024-11-28 05:25:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:42,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532279943] [2024-11-28 05:25:42,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:42,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532279943] [2024-11-28 05:25:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532279943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:42,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:42,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:25:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700600356] [2024-11-28 05:25:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:42,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:25:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:42,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:25:42,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:42,970 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:43,316 INFO L93 Difference]: Finished difference Result 257 states and 299 transitions. [2024-11-28 05:25:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:25:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-28 05:25:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:43,317 INFO L225 Difference]: With dead ends: 257 [2024-11-28 05:25:43,317 INFO L226 Difference]: Without dead ends: 257 [2024-11-28 05:25:43,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:25:43,318 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 102 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:43,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 690 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:25:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-28 05:25:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2024-11-28 05:25:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.5786516853932584) internal successors, (281), 232 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2024-11-28 05:25:43,332 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 18 [2024-11-28 05:25:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:43,335 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2024-11-28 05:25:43,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2024-11-28 05:25:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 05:25:43,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:43,336 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:25:43,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:43,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1725195585, now seen corresponding path program 1 times [2024-11-28 05:25:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465517698] [2024-11-28 05:25:43,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:25:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465517698] [2024-11-28 05:25:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465517698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:43,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:25:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604628992] [2024-11-28 05:25:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:43,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:25:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:43,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:25:43,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:25:43,702 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:44,130 INFO L93 Difference]: Finished difference Result 269 states and 318 transitions. [2024-11-28 05:25:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:25:44,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-28 05:25:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:44,131 INFO L225 Difference]: With dead ends: 269 [2024-11-28 05:25:44,131 INFO L226 Difference]: Without dead ends: 269 [2024-11-28 05:25:44,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:25:44,132 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 227 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:44,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 310 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:25:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-28 05:25:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2024-11-28 05:25:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.5824175824175823) internal successors, (288), 236 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 288 transitions. [2024-11-28 05:25:44,139 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 288 transitions. Word has length 18 [2024-11-28 05:25:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:44,140 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 288 transitions. [2024-11-28 05:25:44,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 288 transitions. [2024-11-28 05:25:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 05:25:44,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:44,140 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:44,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:25:44,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1725195584, now seen corresponding path program 1 times [2024-11-28 05:25:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32508213] [2024-11-28 05:25:44,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:44,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32508213] [2024-11-28 05:25:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32508213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:25:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315313866] [2024-11-28 05:25:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:44,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:44,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:44,217 INFO L87 Difference]: Start difference. First operand 237 states and 288 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:44,465 INFO L93 Difference]: Finished difference Result 262 states and 316 transitions. [2024-11-28 05:25:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-28 05:25:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:44,466 INFO L225 Difference]: With dead ends: 262 [2024-11-28 05:25:44,466 INFO L226 Difference]: Without dead ends: 262 [2024-11-28 05:25:44,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:44,467 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:44,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 182 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-28 05:25:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 238. [2024-11-28 05:25:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 183 states have (on average 1.5846994535519126) internal successors, (290), 237 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 290 transitions. [2024-11-28 05:25:44,474 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 290 transitions. Word has length 18 [2024-11-28 05:25:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:44,474 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 290 transitions. [2024-11-28 05:25:44,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 290 transitions. [2024-11-28 05:25:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 05:25:44,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:44,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:44,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:25:44,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:44,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1880049384, now seen corresponding path program 1 times [2024-11-28 05:25:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:44,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076959466] [2024-11-28 05:25:44,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076959466] [2024-11-28 05:25:44,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076959466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:44,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:25:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623856567] [2024-11-28 05:25:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:44,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:25:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:44,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:25:44,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:25:44,687 INFO L87 Difference]: Start difference. First operand 238 states and 290 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:44,947 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2024-11-28 05:25:44,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:25:44,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-28 05:25:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:44,948 INFO L225 Difference]: With dead ends: 223 [2024-11-28 05:25:44,948 INFO L226 Difference]: Without dead ends: 223 [2024-11-28 05:25:44,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:25:44,949 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:44,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 595 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-28 05:25:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 210. [2024-11-28 05:25:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 155 states have (on average 1.5806451612903225) internal successors, (245), 209 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 245 transitions. [2024-11-28 05:25:44,959 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 245 transitions. Word has length 18 [2024-11-28 05:25:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:44,959 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 245 transitions. [2024-11-28 05:25:44,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2024-11-28 05:25:44,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 05:25:44,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:44,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:44,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:25:44,962 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:44,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1941458419, now seen corresponding path program 1 times [2024-11-28 05:25:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709044519] [2024-11-28 05:25:44,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:45,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:45,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709044519] [2024-11-28 05:25:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709044519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407071104] [2024-11-28 05:25:45,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:45,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:45,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:45,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:25:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:45,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:25:45,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:25:45,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:25:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407071104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:45,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:25:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-28 05:25:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147123631] [2024-11-28 05:25:45,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:45,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:25:45,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:45,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:25:45,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:25:45,277 INFO L87 Difference]: Start difference. First operand 210 states and 245 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:45,451 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2024-11-28 05:25:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-28 05:25:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:45,453 INFO L225 Difference]: With dead ends: 223 [2024-11-28 05:25:45,454 INFO L226 Difference]: Without dead ends: 223 [2024-11-28 05:25:45,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:25:45,454 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 132 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:45,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 402 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:25:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-28 05:25:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2024-11-28 05:25:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 154 states have (on average 1.577922077922078) internal successors, (243), 208 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2024-11-28 05:25:45,462 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 19 [2024-11-28 05:25:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:45,462 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2024-11-28 05:25:45,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2024-11-28 05:25:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 05:25:45,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:45,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:45,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:25:45,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:45,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:45,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash 940746083, now seen corresponding path program 1 times [2024-11-28 05:25:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:45,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006030646] [2024-11-28 05:25:45,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:45,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:45,786 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-28 05:25:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006030646] [2024-11-28 05:25:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006030646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:45,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261618442] [2024-11-28 05:25:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:45,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:25:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:45,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:25:45,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:45,789 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:46,029 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2024-11-28 05:25:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:46,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-28 05:25:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:46,030 INFO L225 Difference]: With dead ends: 208 [2024-11-28 05:25:46,030 INFO L226 Difference]: Without dead ends: 208 [2024-11-28 05:25:46,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:25:46,031 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:46,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 368 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-28 05:25:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-28 05:25:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 154 states have (on average 1.5649350649350648) internal successors, (241), 207 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2024-11-28 05:25:46,037 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 19 [2024-11-28 05:25:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:46,037 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2024-11-28 05:25:46,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2024-11-28 05:25:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 05:25:46,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:46,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:46,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:25:46,038 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:46,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:46,039 INFO L85 PathProgramCache]: Analyzing trace with hash 940746084, now seen corresponding path program 1 times [2024-11-28 05:25:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811541478] [2024-11-28 05:25:46,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:46,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:46,216 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-28 05:25:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:46,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811541478] [2024-11-28 05:25:46,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811541478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:46,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:46,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676838680] [2024-11-28 05:25:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:46,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:25:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:46,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:25:46,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:46,219 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:46,489 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2024-11-28 05:25:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:46,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-28 05:25:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:46,490 INFO L225 Difference]: With dead ends: 207 [2024-11-28 05:25:46,491 INFO L226 Difference]: Without dead ends: 207 [2024-11-28 05:25:46,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:25:46,492 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:46,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 350 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-28 05:25:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-28 05:25:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 154 states have (on average 1.551948051948052) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2024-11-28 05:25:46,501 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 19 [2024-11-28 05:25:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:46,505 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2024-11-28 05:25:46,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2024-11-28 05:25:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:25:46,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:46,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:46,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:25:46,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:46,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1105005910, now seen corresponding path program 1 times [2024-11-28 05:25:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:46,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956589416] [2024-11-28 05:25:46,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:46,750 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-28 05:25:46,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956589416] [2024-11-28 05:25:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956589416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:25:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64207405] [2024-11-28 05:25:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:46,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:25:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:46,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:25:46,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:25:46,752 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:47,234 INFO L93 Difference]: Finished difference Result 216 states and 249 transitions. [2024-11-28 05:25:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:25:47,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-28 05:25:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:47,235 INFO L225 Difference]: With dead ends: 216 [2024-11-28 05:25:47,235 INFO L226 Difference]: Without dead ends: 216 [2024-11-28 05:25:47,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:25:47,236 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 158 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:47,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 289 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:25:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-28 05:25:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 206. [2024-11-28 05:25:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 154 states have (on average 1.5389610389610389) internal successors, (237), 205 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2024-11-28 05:25:47,242 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 22 [2024-11-28 05:25:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:47,242 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2024-11-28 05:25:47,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2024-11-28 05:25:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:25:47,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:47,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:47,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:25:47,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:47,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1105005911, now seen corresponding path program 1 times [2024-11-28 05:25:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:47,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014564465] [2024-11-28 05:25:47,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:47,589 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-28 05:25:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014564465] [2024-11-28 05:25:47,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014564465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:47,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:47,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:25:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720875334] [2024-11-28 05:25:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:47,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:25:47,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:47,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:25:47,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:25:47,591 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:48,259 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2024-11-28 05:25:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:25:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-28 05:25:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:48,261 INFO L225 Difference]: With dead ends: 215 [2024-11-28 05:25:48,261 INFO L226 Difference]: Without dead ends: 215 [2024-11-28 05:25:48,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:25:48,261 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 153 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:48,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 366 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:25:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-28 05:25:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 205. [2024-11-28 05:25:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 154 states have (on average 1.525974025974026) internal successors, (235), 204 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2024-11-28 05:25:48,267 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 22 [2024-11-28 05:25:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:48,268 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2024-11-28 05:25:48,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2024-11-28 05:25:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 05:25:48,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:48,268 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:25:48,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:25:48,269 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:48,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1808663744, now seen corresponding path program 1 times [2024-11-28 05:25:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154246100] [2024-11-28 05:25:48,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:48,375 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-28 05:25:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:48,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154246100] [2024-11-28 05:25:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154246100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:48,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:48,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509552441] [2024-11-28 05:25:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:25:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:48,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:25:48,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:48,377 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:48,599 INFO L93 Difference]: Finished difference Result 204 states and 233 transitions. [2024-11-28 05:25:48,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 05:25:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:48,601 INFO L225 Difference]: With dead ends: 204 [2024-11-28 05:25:48,601 INFO L226 Difference]: Without dead ends: 204 [2024-11-28 05:25:48,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:25:48,602 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:48,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 358 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-28 05:25:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-28 05:25:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 154 states have (on average 1.5129870129870129) internal successors, (233), 203 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2024-11-28 05:25:48,607 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 23 [2024-11-28 05:25:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:48,607 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2024-11-28 05:25:48,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2024-11-28 05:25:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 05:25:48,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:48,608 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:25:48,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:25:48,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:48,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1808663743, now seen corresponding path program 1 times [2024-11-28 05:25:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291994356] [2024-11-28 05:25:48,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:48,773 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-28 05:25:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291994356] [2024-11-28 05:25:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291994356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:48,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:48,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:48,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243331220] [2024-11-28 05:25:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:48,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:25:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:48,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:25:48,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:48,775 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:49,025 INFO L93 Difference]: Finished difference Result 203 states and 231 transitions. [2024-11-28 05:25:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 05:25:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:49,027 INFO L225 Difference]: With dead ends: 203 [2024-11-28 05:25:49,027 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 05:25:49,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:25:49,028 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:49,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 340 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:25:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 05:25:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-28 05:25:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 154 states have (on average 1.5) internal successors, (231), 202 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 231 transitions. [2024-11-28 05:25:49,033 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 231 transitions. Word has length 23 [2024-11-28 05:25:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:49,035 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 231 transitions. [2024-11-28 05:25:49,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 231 transitions. [2024-11-28 05:25:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:25:49,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:49,036 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:25:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:25:49,036 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1536781765, now seen corresponding path program 1 times [2024-11-28 05:25:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296205427] [2024-11-28 05:25:49,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:49,265 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-28 05:25:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:49,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296205427] [2024-11-28 05:25:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296205427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:49,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:49,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:25:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016218062] [2024-11-28 05:25:49,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:49,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:25:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:49,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:25:49,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:25:49,268 INFO L87 Difference]: Start difference. First operand 203 states and 231 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:49,777 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2024-11-28 05:25:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:25:49,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-28 05:25:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:49,779 INFO L225 Difference]: With dead ends: 212 [2024-11-28 05:25:49,779 INFO L226 Difference]: Without dead ends: 212 [2024-11-28 05:25:49,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:25:49,779 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 143 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:49,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 330 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:25:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-28 05:25:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2024-11-28 05:25:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 154 states have (on average 1.4935064935064934) internal successors, (230), 201 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 230 transitions. [2024-11-28 05:25:49,785 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 230 transitions. Word has length 26 [2024-11-28 05:25:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:49,785 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 230 transitions. [2024-11-28 05:25:49,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2024-11-28 05:25:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:25:49,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:49,786 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:25:49,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:25:49,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:49,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:49,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1536781764, now seen corresponding path program 1 times [2024-11-28 05:25:49,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:49,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485377725] [2024-11-28 05:25:49,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:50,102 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-28 05:25:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:50,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485377725] [2024-11-28 05:25:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485377725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:25:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218101658] [2024-11-28 05:25:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:50,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:25:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:50,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:25:50,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:25:50,104 INFO L87 Difference]: Start difference. First operand 202 states and 230 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:50,736 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2024-11-28 05:25:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:25:50,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-28 05:25:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:50,738 INFO L225 Difference]: With dead ends: 211 [2024-11-28 05:25:50,738 INFO L226 Difference]: Without dead ends: 211 [2024-11-28 05:25:50,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:25:50,738 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 142 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:50,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 363 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:25:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-28 05:25:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2024-11-28 05:25:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.4870129870129871) internal successors, (229), 200 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 229 transitions. [2024-11-28 05:25:50,744 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 229 transitions. Word has length 26 [2024-11-28 05:25:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:50,744 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 229 transitions. [2024-11-28 05:25:50,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 229 transitions. [2024-11-28 05:25:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 05:25:50,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:50,745 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:50,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 05:25:50,745 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:50,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 782567233, now seen corresponding path program 1 times [2024-11-28 05:25:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868852341] [2024-11-28 05:25:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:51,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868852341] [2024-11-28 05:25:51,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868852341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:51,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532936112] [2024-11-28 05:25:51,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:51,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:51,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:51,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:51,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:25:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:51,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 05:25:51,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:51,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:25:51,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:25:51,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:51,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:51,772 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 05:25:51,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:51,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:51,786 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 05:25:51,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:51,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2024-11-28 05:25:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-28 05:25:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:52,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:52,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-28 05:25:52,313 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 16 treesize of output 12 [2024-11-28 05:25:52,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-28 05:25:52,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:52,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532936112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:52,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 20 [2024-11-28 05:25:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594627837] [2024-11-28 05:25:52,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 05:25:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 05:25:52,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-28 05:25:52,353 INFO L87 Difference]: Start difference. First operand 201 states and 229 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:54,110 INFO L93 Difference]: Finished difference Result 333 states and 387 transitions. [2024-11-28 05:25:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:25:54,111 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 05:25:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:54,112 INFO L225 Difference]: With dead ends: 333 [2024-11-28 05:25:54,113 INFO L226 Difference]: Without dead ends: 333 [2024-11-28 05:25:54,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2024-11-28 05:25:54,114 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 497 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:54,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1443 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 05:25:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-28 05:25:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 271. [2024-11-28 05:25:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 224 states have (on average 1.4375) internal successors, (322), 270 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 322 transitions. [2024-11-28 05:25:54,122 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 322 transitions. Word has length 27 [2024-11-28 05:25:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:54,122 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 322 transitions. [2024-11-28 05:25:54,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 322 transitions. [2024-11-28 05:25:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 05:25:54,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:54,123 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:54,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:25:54,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 05:25:54,327 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:25:54,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1694016893, now seen corresponding path program 2 times [2024-11-28 05:25:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:54,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672087005] [2024-11-28 05:25:54,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:54,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:54,370 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:54,372 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672087005] [2024-11-28 05:25:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672087005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956431207] [2024-11-28 05:25:56,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:56,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:56,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:56,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:56,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:25:56,502 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:56,502 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:56,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-28 05:25:56,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:56,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:56,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:56,945 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 19 treesize of output 18 [2024-11-28 05:25:56,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-28 05:25:57,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:57,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-28 05:25:57,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-28 05:25:57,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:25:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:57,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:59,431 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 22 [2024-11-28 05:25:59,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:59,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:59,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2024-11-28 05:25:59,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-28 05:25:59,519 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:59,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:59,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956431207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:59,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 43 [2024-11-28 05:25:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707729742] [2024-11-28 05:25:59,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:59,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 05:25:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:59,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 05:25:59,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1658, Unknown=0, NotChecked=0, Total=1806 [2024-11-28 05:25:59,783 INFO L87 Difference]: Start difference. First operand 271 states and 322 transitions. Second operand has 43 states, 43 states have (on average 2.372093023255814) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:05,538 INFO L93 Difference]: Finished difference Result 342 states and 399 transitions. [2024-11-28 05:26:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-28 05:26:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.372093023255814) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-28 05:26:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:05,541 INFO L225 Difference]: With dead ends: 342 [2024-11-28 05:26:05,541 INFO L226 Difference]: Without dead ends: 342 [2024-11-28 05:26:05,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=702, Invalid=5778, Unknown=0, NotChecked=0, Total=6480 [2024-11-28 05:26:05,550 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 293 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:05,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2569 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 05:26:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-28 05:26:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 317. [2024-11-28 05:26:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 270 states have (on average 1.3777777777777778) internal successors, (372), 316 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 372 transitions. [2024-11-28 05:26:05,561 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 372 transitions. Word has length 36 [2024-11-28 05:26:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:05,561 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 372 transitions. [2024-11-28 05:26:05,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.372093023255814) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 372 transitions. [2024-11-28 05:26:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:26:05,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:05,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:05,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:26:05,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 05:26:05,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:26:05,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash -974913295, now seen corresponding path program 1 times [2024-11-28 05:26:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439866283] [2024-11-28 05:26:05,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-28 05:26:05,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:05,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439866283] [2024-11-28 05:26:05,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439866283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:05,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182923438] [2024-11-28 05:26:05,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:05,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:05,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:05,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:05,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:26:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:06,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 05:26:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:26:06,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 05:26:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182923438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:07,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 8] total 12 [2024-11-28 05:26:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679733654] [2024-11-28 05:26:07,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:26:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:07,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:26:07,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:26:07,056 INFO L87 Difference]: Start difference. First operand 317 states and 372 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:07,338 INFO L93 Difference]: Finished difference Result 351 states and 410 transitions. [2024-11-28 05:26:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:26:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:26:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:07,340 INFO L225 Difference]: With dead ends: 351 [2024-11-28 05:26:07,341 INFO L226 Difference]: Without dead ends: 351 [2024-11-28 05:26:07,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:26:07,342 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 317 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:07,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 619 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:26:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-28 05:26:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 319. [2024-11-28 05:26:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 272 states have (on average 1.3786764705882353) internal successors, (375), 318 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 375 transitions. [2024-11-28 05:26:07,353 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 375 transitions. Word has length 37 [2024-11-28 05:26:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 375 transitions. [2024-11-28 05:26:07,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 375 transitions. [2024-11-28 05:26:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 05:26:07,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:07,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:07,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:26:07,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 05:26:07,555 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:26:07,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash -157535936, now seen corresponding path program 1 times [2024-11-28 05:26:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:07,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303790386] [2024-11-28 05:26:07,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 05:26:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303790386] [2024-11-28 05:26:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303790386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:26:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:26:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:26:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313753788] [2024-11-28 05:26:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:26:07,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:26:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:07,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:26:07,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:26:07,671 INFO L87 Difference]: Start difference. First operand 319 states and 375 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:07,807 INFO L93 Difference]: Finished difference Result 320 states and 378 transitions. [2024-11-28 05:26:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:26:07,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 05:26:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:07,810 INFO L225 Difference]: With dead ends: 320 [2024-11-28 05:26:07,810 INFO L226 Difference]: Without dead ends: 320 [2024-11-28 05:26:07,810 INFO L434 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-28 05:26:07,811 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:07,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:26:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-28 05:26:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-28 05:26:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 275 states have (on average 1.3745454545454545) internal successors, (378), 319 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 378 transitions. [2024-11-28 05:26:07,821 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 378 transitions. Word has length 38 [2024-11-28 05:26:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:07,821 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 378 transitions. [2024-11-28 05:26:07,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 378 transitions. [2024-11-28 05:26:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 05:26:07,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:07,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:07,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:26:07,822 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:26:07,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -157535935, now seen corresponding path program 1 times [2024-11-28 05:26:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:07,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604885898] [2024-11-28 05:26:07,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:07,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 05:26:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604885898] [2024-11-28 05:26:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604885898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:26:07,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:26:07,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:26:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532957376] [2024-11-28 05:26:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:26:07,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:26:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:07,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:26:07,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:26:07,953 INFO L87 Difference]: Start difference. First operand 320 states and 378 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:08,114 INFO L93 Difference]: Finished difference Result 318 states and 375 transitions. [2024-11-28 05:26:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:26:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 05:26:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:08,116 INFO L225 Difference]: With dead ends: 318 [2024-11-28 05:26:08,116 INFO L226 Difference]: Without dead ends: 318 [2024-11-28 05:26:08,116 INFO L434 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-28 05:26:08,117 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:08,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:26:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-28 05:26:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-28 05:26:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 275 states have (on average 1.3636363636363635) internal successors, (375), 317 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 375 transitions. [2024-11-28 05:26:08,127 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 375 transitions. Word has length 38 [2024-11-28 05:26:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:08,128 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 375 transitions. [2024-11-28 05:26:08,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 375 transitions. [2024-11-28 05:26:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:26:08,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:08,129 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-28 05:26:08,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 05:26:08,129 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:26:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash 146742560, now seen corresponding path program 1 times [2024-11-28 05:26:08,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:08,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535711787] [2024-11-28 05:26:08,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:09,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535711787] [2024-11-28 05:26:09,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535711787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:09,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531208112] [2024-11-28 05:26:09,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:09,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:09,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:09,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:09,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:26:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:09,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-28 05:26:09,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:09,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:26:09,618 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-28 05:26:09,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:26:09,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:26:09,857 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:26:09,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:26:09,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:26:10,044 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:26:10,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:26:10,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:26:10,204 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:26:10,204 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-28 05:26:10,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:26:10,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:26:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:10,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:11,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_84| Int)) (or (< |v_ULTIMATE.start_main_~n~0#1.offset_84| 0) (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_84|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_84|))) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_84|))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_84| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_84|))) (or (forall ((v_ArrVal_948 Int) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_14| Int)) (<= (+ 4 .cse1) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_14| v_ArrVal_948) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_84|)))) (< |v_ULTIMATE.start_main_~n~0#1.offset_84| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_84|) (= .cse1 0)))) (forall ((v_ArrVal_946 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_84| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_84|) 1)) (< |v_ULTIMATE.start_main_~n~0#1.offset_84| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_84|))))) is different from false [2024-11-28 05:26:12,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:12,102 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 219 treesize of output 271 [2024-11-28 05:26:12,723 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_5))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9))) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_9) (< v_prenex_9 0) (forall ((v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_1))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_947)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) .cse1)) (= |c_ULTIMATE.start_main_#t~mem15#1.base| .cse1)))) (forall ((v_prenex_4 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_4) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_3) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_1) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_2) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) 0) (< v_prenex_4 0))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_9) (< v_prenex_9 0) (= |c_ULTIMATE.start_main_#t~mem15#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_5))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9)))) (forall ((v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem15#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_1))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_947)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4)))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_7) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_5) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_6) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9) (+ |c_ULTIMATE.start_main_#t~mem15#1.offset| 1)) (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_9) (< v_prenex_9 0))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_main_#t~mem15#1.base| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_5))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9))) (forall ((v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_1))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem15#1.base| (select (select (store .cse6 .cse7 v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4)) (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_4) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_3) .cse7 v_prenex_2) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) 0) (< v_prenex_4 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_5))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9))) (or (forall ((v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_1))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_4) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_3) .cse8 v_prenex_2) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) 0)) (= (select (select (store .cse9 .cse8 v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) .cse10) (< v_prenex_4 0))))) (= |c_ULTIMATE.start_main_#t~mem15#1.base| .cse10)))) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_84| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_945) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_84|) 1)) (< |v_ULTIMATE.start_main_~n~0#1.offset_84| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_84|)))) is different from false [2024-11-28 05:26:12,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_9) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_7) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_5) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_6) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) 1)) (< v_prenex_9 0))) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_84| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_945) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_84|) 1)) (< |v_ULTIMATE.start_main_~n~0#1.offset_84| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_84|))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_9) (< v_prenex_9 0) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_5))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9) .cse0))) (forall ((v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_1))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_947)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) .cse0))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_5))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9))) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_9) (< v_prenex_9 0) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_1))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_947)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) .cse4) (= .cse4 .cse0)))) (forall ((v_prenex_4 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_4) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_3) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_1) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_2) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) 0) (< v_prenex_4 0))) (or (forall ((v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_1))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (or (= (select (select (store .cse6 .cse7 v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) .cse0) (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_4) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_3) .cse7 v_prenex_2) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) 0) (< v_prenex_4 0))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_5))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9) .cse0))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_947 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_1))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_5))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_8)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_9))) (or (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_4) (= (select (select (store .cse9 .cse10 v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) .cse11) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_3) .cse10 v_prenex_2) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_4) 0) (= .cse11 .cse0) (< v_prenex_4 0))))))) is different from false [2024-11-28 05:26:13,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:13,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-28 05:26:13,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-28 05:26:13,209 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 54 treesize of output 46 [2024-11-28 05:26:13,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:13,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2024-11-28 05:26:13,247 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 56 treesize of output 54 [2024-11-28 05:26:13,257 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 54 treesize of output 50 [2024-11-28 05:26:13,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2024-11-28 05:26:13,417 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:26:13,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2024-11-28 05:26:13,430 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:26:13,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 1 [2024-11-28 05:26:13,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:13,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2024-11-28 05:26:13,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:13,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-28 05:26:13,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:26:13,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:26:13,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:13,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:13,485 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:26:13,486 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 87 [2024-11-28 05:26:13,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-28 05:26:13,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-28 05:26:13,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:26:13,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:13,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:13,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 05:26:13,540 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:13,553 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:26:13,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2024-11-28 05:26:13,565 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:26:13,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2024-11-28 05:26:14,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:14,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2024-11-28 05:26:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:14,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531208112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:14,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:14,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 42 [2024-11-28 05:26:14,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359016055] [2024-11-28 05:26:14,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:14,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 05:26:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:14,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 05:26:14,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1409, Unknown=8, NotChecked=234, Total=1806 [2024-11-28 05:26:14,447 INFO L87 Difference]: Start difference. First operand 318 states and 375 transitions. Second operand has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 43 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:18,581 INFO L93 Difference]: Finished difference Result 433 states and 512 transitions. [2024-11-28 05:26:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:26:18,582 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 43 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 05:26:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:18,584 INFO L225 Difference]: With dead ends: 433 [2024-11-28 05:26:18,584 INFO L226 Difference]: Without dead ends: 433 [2024-11-28 05:26:18,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=557, Invalid=2869, Unknown=8, NotChecked=348, Total=3782 [2024-11-28 05:26:18,586 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 802 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 3170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 834 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:18,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1689 Invalid, 3170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2263 Invalid, 0 Unknown, 834 Unchecked, 2.3s Time] [2024-11-28 05:26:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-28 05:26:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 370. [2024-11-28 05:26:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 332 states have (on average 1.3493975903614457) internal successors, (448), 369 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 448 transitions. [2024-11-28 05:26:18,596 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 448 transitions. Word has length 41 [2024-11-28 05:26:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:18,597 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 448 transitions. [2024-11-28 05:26:18,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 43 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 448 transitions. [2024-11-28 05:26:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:26:18,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:18,598 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-28 05:26:18,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:26:18,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 05:26:18,799 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:26:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash 146742559, now seen corresponding path program 1 times [2024-11-28 05:26:18,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:18,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920571807] [2024-11-28 05:26:18,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:18,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:19,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:19,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920571807] [2024-11-28 05:26:19,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920571807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:19,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412899942] [2024-11-28 05:26:19,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:19,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:19,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:19,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:26:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:19,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 05:26:19,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:20,134 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:26:20,135 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-28 05:26:20,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:26:20,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:26:20,373 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:26:20,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-28 05:26:20,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-28 05:26:20,533 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:26:20,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2024-11-28 05:26:20,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-28 05:26:20,699 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:26:20,699 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-28 05:26:20,794 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-28 05:26:20,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:26:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:21,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:21,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:21,371 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-28 05:26:21,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1048))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1051) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) (forall ((v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) 0)) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1048) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1050) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-28 05:26:21,845 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 05:26:21,846 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 49 treesize of output 52 [2024-11-28 05:26:21,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:21,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-28 05:26:21,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2024-11-28 05:26:21,871 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 16 treesize of output 14 [2024-11-28 05:26:21,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:21,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 97 [2024-11-28 05:26:21,917 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 46 treesize of output 42 [2024-11-28 05:26:22,068 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:26:22,068 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 1 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 05:26:22,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:22,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 74 [2024-11-28 05:26:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412899942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:22,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2024-11-28 05:26:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618983169] [2024-11-28 05:26:22,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:22,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 05:26:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:22,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 05:26:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1143, Unknown=49, NotChecked=70, Total=1406 [2024-11-28 05:26:22,422 INFO L87 Difference]: Start difference. First operand 370 states and 448 transitions. Second operand has 38 states, 37 states have (on average 3.0) internal successors, (111), 38 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:25,607 INFO L93 Difference]: Finished difference Result 469 states and 562 transitions. [2024-11-28 05:26:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:26:25,608 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 38 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 05:26:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:25,609 INFO L225 Difference]: With dead ends: 469 [2024-11-28 05:26:25,609 INFO L226 Difference]: Without dead ends: 469 [2024-11-28 05:26:25,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=604, Invalid=2638, Unknown=68, NotChecked=112, Total=3422 [2024-11-28 05:26:25,611 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 811 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:25,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1295 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1731 Invalid, 0 Unknown, 306 Unchecked, 1.8s Time] [2024-11-28 05:26:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-28 05:26:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 370. [2024-11-28 05:26:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 332 states have (on average 1.3463855421686748) internal successors, (447), 369 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 447 transitions. [2024-11-28 05:26:25,624 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 447 transitions. Word has length 41 [2024-11-28 05:26:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:25,624 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 447 transitions. [2024-11-28 05:26:25,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 38 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 447 transitions. [2024-11-28 05:26:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:26:25,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:25,626 INFO L218 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] [2024-11-28 05:26:25,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 05:26:25,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 05:26:25,830 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:26:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash 836462965, now seen corresponding path program 1 times [2024-11-28 05:26:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52297037] [2024-11-28 05:26:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52297037] [2024-11-28 05:26:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52297037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122762296] [2024-11-28 05:26:26,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:26,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:26,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:26,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:26:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:26,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 05:26:26,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:26,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:27,113 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-28 05:26:27,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-28 05:26:27,125 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-28 05:26:27,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 05:26:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122762296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:27,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-28 05:26:27,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468634577] [2024-11-28 05:26:27,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:27,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:26:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:27,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:26:27,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:26:27,213 INFO L87 Difference]: Start difference. First operand 370 states and 447 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:28,147 INFO L93 Difference]: Finished difference Result 424 states and 500 transitions. [2024-11-28 05:26:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:26:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 05:26:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:28,150 INFO L225 Difference]: With dead ends: 424 [2024-11-28 05:26:28,150 INFO L226 Difference]: Without dead ends: 424 [2024-11-28 05:26:28,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2024-11-28 05:26:28,151 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 220 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:28,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1212 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:26:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-28 05:26:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 387. [2024-11-28 05:26:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 349 states have (on average 1.3123209169054442) internal successors, (458), 386 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 458 transitions. [2024-11-28 05:26:28,161 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 458 transitions. Word has length 41 [2024-11-28 05:26:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:28,161 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 458 transitions. [2024-11-28 05:26:28,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 458 transitions. [2024-11-28 05:26:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:26:28,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:28,163 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-28 05:26:28,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:26:28,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:26:28,364 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:26:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1500607456, now seen corresponding path program 1 times [2024-11-28 05:26:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367492377] [2024-11-28 05:26:28,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367492377] [2024-11-28 05:26:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367492377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016702403] [2024-11-28 05:26:29,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:29,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:29,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:29,259 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:29,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:26:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:29,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 05:26:29,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:29,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:26:29,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:26:29,568 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 19 treesize of output 18 [2024-11-28 05:26:29,580 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 19 treesize of output 18 [2024-11-28 05:26:30,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:26:30,130 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-28 05:26:30,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:30,230 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-28 05:26:30,231 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 34 treesize of output 25 [2024-11-28 05:26:30,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:30,272 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-28 05:26:30,272 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 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 05:26:30,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:26:30,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 62 [2024-11-28 05:26:30,538 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 39 treesize of output 20 [2024-11-28 05:26:30,835 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:26:30,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2024-11-28 05:26:30,853 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:26:30,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2024-11-28 05:26:31,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:31,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2024-11-28 05:26:31,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:31,229 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 31 treesize of output 23 [2024-11-28 05:26:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:31,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:31,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1226))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1227)) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1225) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1228) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0) (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|))))) is different from false [2024-11-28 05:26:31,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1226))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1227)) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1225) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1226) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1228) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|)))))) is different from false [2024-11-28 05:26:31,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (|ULTIMATE.start_main_#t~malloc20#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1225) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1228) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0) (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|))) (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (= 0 (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1226))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1227)) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|)) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|)))))) is different from false [2024-11-28 05:26:32,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:32,707 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 118 treesize of output 136 [2024-11-28 05:26:32,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_33 Int) (v_prenex_31 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 v_prenex_31)) v_prenex_31 v_prenex_32))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1227)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_33) 0) (= v_prenex_31 |c_ULTIMATE.start_main_~n~0#1.base|) (< v_prenex_33 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_33))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_12| Int) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (|ULTIMATE.start_main_#t~malloc20#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_12| |c_ULTIMATE.start_main_~n~0#1.base|) (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_12| v_ArrVal_1225) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_12| v_ArrVal_1226) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1228) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0))))) is different from false [2024-11-28 05:26:42,495 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 10 treesize of output 8 [2024-11-28 05:26:42,519 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 14 treesize of output 12 [2024-11-28 05:26:42,547 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 10 treesize of output 8 [2024-11-28 05:26:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016702403] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:26:42,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [16, 16] total 38 [2024-11-28 05:26:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381427380] [2024-11-28 05:26:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:26:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:26:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:42,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:26:42,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=961, Unknown=12, NotChecked=268, Total=1406 [2024-11-28 05:26:42,801 INFO L87 Difference]: Start difference. First operand 387 states and 458 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:43,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0))) (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|))) (forall ((v_ArrVal_1227 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_33 Int) (v_prenex_31 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 v_prenex_31)) v_prenex_31 v_prenex_32))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1227)) |c_ULTIMATE.start_main_~root~0#1.base|) v_prenex_33) 0) (= v_prenex_31 |c_ULTIMATE.start_main_~n~0#1.base|) (< v_prenex_33 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| v_prenex_33))) (or (and (= (select .cse2 |c_ULTIMATE.start_main_~n~0#1.offset|) 0) (= (select .cse3 |c_ULTIMATE.start_main_~n~0#1.offset|) 0)) (< |c_ULTIMATE.start_main_~n~0#1.offset| 0)) (< |c_ULTIMATE.start_main_~root~0#1.offset| 1) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_12| Int) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (|ULTIMATE.start_main_#t~malloc20#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.offset_95| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc20#1.base_12| |c_ULTIMATE.start_main_~n~0#1.base|) (< |v_ULTIMATE.start_main_~n~0#1.offset_95| 0) (< |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_~n~0#1.offset_95|) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse3 .cse1 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_12| v_ArrVal_1225) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_12| v_ArrVal_1226) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1228) |c_ULTIMATE.start_main_~root~0#1.base|) |v_ULTIMATE.start_main_~n~0#1.offset_95|) 0))))) is different from false [2024-11-28 05:26:47,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 05:26:58,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 05:27:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:27:06,051 INFO L93 Difference]: Finished difference Result 591 states and 697 transitions. [2024-11-28 05:27:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 05:27:06,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 05:27:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:27:06,054 INFO L225 Difference]: With dead ends: 591 [2024-11-28 05:27:06,055 INFO L226 Difference]: Without dead ends: 591 [2024-11-28 05:27:06,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=302, Invalid=2365, Unknown=109, NotChecked=530, Total=3306 [2024-11-28 05:27:06,057 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 168 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 12 mSolverCounterUnsat, 87 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 87 IncrementalHoareTripleChecker+Unknown, 946 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:27:06,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1472 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 650 Invalid, 87 Unknown, 946 Unchecked, 15.2s Time] [2024-11-28 05:27:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-28 05:27:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 479. [2024-11-28 05:27:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 441 states have (on average 1.3129251700680271) internal successors, (579), 478 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:27:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 579 transitions. [2024-11-28 05:27:06,071 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 579 transitions. Word has length 41 [2024-11-28 05:27:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:27:06,072 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 579 transitions. [2024-11-28 05:27:06,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:27:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 579 transitions. [2024-11-28 05:27:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:27:06,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:27:06,073 INFO L218 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] [2024-11-28 05:27:06,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:27:06,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 05:27:06,274 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-28 05:27:06,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:27:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash -810887051, now seen corresponding path program 1 times [2024-11-28 05:27:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:27:06,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884966041] [2024-11-28 05:27:06,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:27:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:27:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:27:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:27:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:27:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884966041] [2024-11-28 05:27:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884966041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:27:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161777397] [2024-11-28 05:27:08,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:27:08,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:27:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:27:08,510 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:27:08,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4bf53ee-a72c-4746-aebd-c4ab996d1ba2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:27:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:27:08,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 05:27:08,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:27:09,203 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:27:09,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 05:27:09,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:27:09,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:27:09,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:27:10,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:27:10,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 05:27:10,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 05:27:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:27:11,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:27:12,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-28 05:27:12,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1301) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-28 05:27:12,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (Array Int Int))) (= 1 (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1301)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2024-11-28 05:27:12,173 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1301))) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-28 05:27:12,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:27:12,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2024-11-28 05:27:12,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:27:12,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 251 [2024-11-28 05:27:12,281 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 191 treesize of output 175 [2024-11-28 05:27:12,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:27:12,327 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 175 treesize of output 159 [2024-11-28 05:31:00,425 WARN L286 SmtUtils]: Spent 3.49m on a formula simplification that was a NOOP. DAG size: 6051 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 05:31:00,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:31:00,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 55 select indices, 55 select index equivalence classes, 0 disjoint index pairs (out of 1485 index pairs), introduced 55 new quantified variables, introduced 1485 case distinctions, treesize of input 770 treesize of output 12524 [2024-11-28 05:31:31,153 WARN L286 SmtUtils]: Spent 30.68s on a formula simplification. DAG size of input: 6247 DAG size of output: 6117 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)