./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:55:29,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:55:30,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:55:30,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:55:30,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:55:30,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:55:30,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:55:30,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:55:30,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:55:30,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:55:30,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:55:30,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:55:30,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:55:30,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:55:30,051 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:55:30,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:55:30,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:55:30,053 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:55:30,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:55:30,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:55:30,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:55:30,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:55:30,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:55:30,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:55:30,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:55:30,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:55:30,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:55:30,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:55:30,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:55:30,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:55:30,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:55:30,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:55:30,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:55:30,054 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_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2024-11-13 13:55:30,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:55:30,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:55:30,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:55:30,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:55:30,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:55:30,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i Unable to find full path for "g++" [2024-11-13 13:55:32,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:55:32,515 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:55:32,516 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-13 13:55:32,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/data/e2885a9f6/293c37e0e68d4f808a35e6cf3c06233b/FLAG93f6cc2c9 [2024-11-13 13:55:32,775 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/data/e2885a9f6/293c37e0e68d4f808a35e6cf3c06233b [2024-11-13 13:55:32,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:55:32,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:55:32,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:55:32,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:55:32,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:55:32,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:55:32" (1/1) ... [2024-11-13 13:55:32,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfb2de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:32, skipping insertion in model container [2024-11-13 13:55:32,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:55:32" (1/1) ... [2024-11-13 13:55:32,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:55:33,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:55:33,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:55:33,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:55:33,194 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:55:33,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33 WrapperNode [2024-11-13 13:55:33,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:55:33,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:55:33,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:55:33,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:55:33,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,249 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2024-11-13 13:55:33,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:55:33,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:55:33,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:55:33,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:55:33,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,282 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-13 13:55:33,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:55:33,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:55:33,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:55:33,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:55:33,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (1/1) ... [2024-11-13 13:55:33,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:55:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:33,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:55:33,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:55:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:55:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:55:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:55:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:55:33,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:55:33,546 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:55:33,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:55:33,842 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-13 13:55:33,843 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:55:33,853 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:55:33,853 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 13:55:33,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:55:33 BoogieIcfgContainer [2024-11-13 13:55:33,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:55:33,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:55:33,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:55:33,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:55:33,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:55:32" (1/3) ... [2024-11-13 13:55:33,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7e06d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:55:33, skipping insertion in model container [2024-11-13 13:55:33,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:33" (2/3) ... [2024-11-13 13:55:33,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7e06d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:55:33, skipping insertion in model container [2024-11-13 13:55:33,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:55:33" (3/3) ... [2024-11-13 13:55:33,864 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2024-11-13 13:55:33,881 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:55:33,883 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all_reverse.i that has 1 procedures, 64 locations, 1 initial locations, 6 loop locations, and 21 error locations. [2024-11-13 13:55:33,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:55:33,932 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;@612dc575, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:55:33,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-13 13:55:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 63 states have internal predecessors, (78), 0 states have call successors, (0), 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-13 13:55:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:55:33,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:33,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:55:33,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2024-11-13 13:55:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:33,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909170188] [2024-11-13 13:55:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:34,181 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-13 13:55:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:34,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909170188] [2024-11-13 13:55:34,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909170188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:55:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101054120] [2024-11-13 13:55:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:34,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:34,223 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 63 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:34,321 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-13 13:55:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:34,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 13:55:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:34,331 INFO L225 Difference]: With dead ends: 61 [2024-11-13 13:55:34,332 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 13:55:34,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:34,338 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:34,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 13:55:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-13 13:55:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-13 13:55:34,380 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 5 [2024-11-13 13:55:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:34,380 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-13 13:55:34,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 13:55:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-13 13:55:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:55:34,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:34,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:55:34,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:55:34,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:34,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2024-11-13 13:55:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655104218] [2024-11-13 13:55:34,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:34,596 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-13 13:55:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:34,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655104218] [2024-11-13 13:55:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655104218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:34,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:55:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367330183] [2024-11-13 13:55:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:34,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:34,599 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:34,663 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-13 13:55:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:34,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 13:55:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:34,665 INFO L225 Difference]: With dead ends: 56 [2024-11-13 13:55:34,665 INFO L226 Difference]: Without dead ends: 56 [2024-11-13 13:55:34,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:34,666 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:34,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-13 13:55:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-13 13:55:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.564102564102564) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-11-13 13:55:34,675 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 5 [2024-11-13 13:55:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:34,675 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-13 13:55:34,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 13:55:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-11-13 13:55:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 13:55:34,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:34,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:34,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:55:34,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash 229102192, now seen corresponding path program 1 times [2024-11-13 13:55:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055890414] [2024-11-13 13:55:34,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:34,775 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-13 13:55:34,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055890414] [2024-11-13 13:55:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055890414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:34,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:34,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:55:34,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031807493] [2024-11-13 13:55:34,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:34,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:34,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:34,777 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-13 13:55:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:34,805 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-11-13 13:55:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:34,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-13 13:55:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:34,809 INFO L225 Difference]: With dead ends: 66 [2024-11-13 13:55:34,809 INFO L226 Difference]: Without dead ends: 66 [2024-11-13 13:55:34,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:34,811 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:34,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-13 13:55:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2024-11-13 13:55:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-13 13:55:34,821 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 8 [2024-11-13 13:55:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:34,821 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-13 13:55:34,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-13 13:55:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-13 13:55:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:55:34,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:34,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:34,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:55:34,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:34,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2024-11-13 13:55:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206289575] [2024-11-13 13:55:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:34,973 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-13 13:55:34,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:34,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206289575] [2024-11-13 13:55:34,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206289575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:34,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:34,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:55:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088873327] [2024-11-13 13:55:34,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:34,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:34,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:34,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:34,975 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 13:55:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:35,091 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-13 13:55:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-13 13:55:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:35,092 INFO L225 Difference]: With dead ends: 56 [2024-11-13 13:55:35,092 INFO L226 Difference]: Without dead ends: 56 [2024-11-13 13:55:35,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:35,093 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:35,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 159 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-13 13:55:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-13 13:55:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.525) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-11-13 13:55:35,098 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2024-11-13 13:55:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:35,099 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-13 13:55:35,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 13:55:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-11-13 13:55:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:55:35,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:35,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:55:35,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2024-11-13 13:55:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:35,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589641892] [2024-11-13 13:55:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:35,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:35,323 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-13 13:55:35,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:35,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589641892] [2024-11-13 13:55:35,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589641892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:35,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:35,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:55:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283320902] [2024-11-13 13:55:35,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:35,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:35,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:35,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:35,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:35,325 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 13:55:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:35,455 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-13 13:55:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-13 13:55:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:35,459 INFO L225 Difference]: With dead ends: 55 [2024-11-13 13:55:35,459 INFO L226 Difference]: Without dead ends: 55 [2024-11-13 13:55:35,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:35,460 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:35,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-13 13:55:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-13 13:55:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.5) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 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-13 13:55:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-11-13 13:55:35,466 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 9 [2024-11-13 13:55:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:35,466 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-13 13:55:35,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 13:55:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-13 13:55:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:55:35,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:35,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:35,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:55:35,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:35,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1381842850, now seen corresponding path program 1 times [2024-11-13 13:55:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:35,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856112914] [2024-11-13 13:55:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:35,597 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-13 13:55:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856112914] [2024-11-13 13:55:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856112914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643329291] [2024-11-13 13:55:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:35,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:35,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:55:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:35,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:55:35,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:35,781 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-13 13:55:35,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:35,832 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-13 13:55:35,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643329291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:35,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-13 13:55:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209136320] [2024-11-13 13:55:35,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:35,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:35,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:35,839 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:35,864 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-11-13 13:55:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:55:35,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:55:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:35,865 INFO L225 Difference]: With dead ends: 63 [2024-11-13 13:55:35,865 INFO L226 Difference]: Without dead ends: 63 [2024-11-13 13:55:35,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:35,866 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:35,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 159 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-13 13:55:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-13 13:55:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2024-11-13 13:55:35,870 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 16 [2024-11-13 13:55:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:35,870 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2024-11-13 13:55:35,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2024-11-13 13:55:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:55:35,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:35,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:35,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:55:36,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 13:55:36,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:36,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash -436215732, now seen corresponding path program 2 times [2024-11-13 13:55:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191926091] [2024-11-13 13:55:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:55:36,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191926091] [2024-11-13 13:55:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191926091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:36,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:36,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:55:36,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82641641] [2024-11-13 13:55:36,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:36,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:36,236 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-13 13:55:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:36,332 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-13 13:55:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:55:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 24 [2024-11-13 13:55:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:36,335 INFO L225 Difference]: With dead ends: 90 [2024-11-13 13:55:36,335 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 13:55:36,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:55:36,336 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 110 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:36,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 148 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 13:55:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2024-11-13 13:55:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.392156862745098) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 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-13 13:55:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-13 13:55:36,346 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 24 [2024-11-13 13:55:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:36,347 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-13 13:55:36,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-13 13:55:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-13 13:55:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:55:36,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:36,348 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:36,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:55:36,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash -436215677, now seen corresponding path program 1 times [2024-11-13 13:55:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871791940] [2024-11-13 13:55:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:55:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871791940] [2024-11-13 13:55:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871791940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:36,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:36,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:55:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227752271] [2024-11-13 13:55:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:36,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:55:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:55:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:55:36,616 INFO L87 Difference]: Start difference. First operand 66 states and 71 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-13 13:55:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:36,898 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-13 13:55:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:55:36,899 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 24 [2024-11-13 13:55:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:36,900 INFO L225 Difference]: With dead ends: 69 [2024-11-13 13:55:36,900 INFO L226 Difference]: Without dead ends: 69 [2024-11-13 13:55:36,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:55:36,901 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:36,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 230 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:55:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-13 13:55:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-13 13:55:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 68 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-13 13:55:36,911 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 24 [2024-11-13 13:55:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:36,912 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-13 13:55:36,912 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-13 13:55:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-13 13:55:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:55:36,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:36,912 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:36,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:55:36,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:36,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash -436215676, now seen corresponding path program 1 times [2024-11-13 13:55:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:36,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226392509] [2024-11-13 13:55:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:55:37,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226392509] [2024-11-13 13:55:37,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226392509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:37,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:37,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:55:37,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008314551] [2024-11-13 13:55:37,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:37,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:55:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:55:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:55:37,335 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:37,608 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-13 13:55:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:55:37,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 13:55:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:37,610 INFO L225 Difference]: With dead ends: 69 [2024-11-13 13:55:37,610 INFO L226 Difference]: Without dead ends: 69 [2024-11-13 13:55:37,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:55:37,611 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:37,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 260 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:55:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-13 13:55:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-13 13:55:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-13 13:55:37,615 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2024-11-13 13:55:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:37,615 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-13 13:55:37,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-13 13:55:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:55:37,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:37,616 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:37,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:55:37,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:37,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1269829825, now seen corresponding path program 1 times [2024-11-13 13:55:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450245778] [2024-11-13 13:55:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:38,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450245778] [2024-11-13 13:55:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450245778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120177937] [2024-11-13 13:55:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:38,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:38,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:38,577 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:38,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:55:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:38,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 13:55:38,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:38,796 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:55:38,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 13:55:38,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:55:39,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 13:55:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:39,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:39,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120177937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:39,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:39,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 32 [2024-11-13 13:55:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412101037] [2024-11-13 13:55:39,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:39,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 13:55:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 13:55:39,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 13:55:39,602 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:40,342 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-11-13 13:55:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:55:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:55:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:40,344 INFO L225 Difference]: With dead ends: 84 [2024-11-13 13:55:40,345 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 13:55:40,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 13:55:40,346 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:40,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 561 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:55:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 13:55:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2024-11-13 13:55:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 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-13 13:55:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-13 13:55:40,351 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 27 [2024-11-13 13:55:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:40,351 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-13 13:55:40,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-13 13:55:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:55:40,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:40,351 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:40,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:55:40,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 13:55:40,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:40,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1269829826, now seen corresponding path program 1 times [2024-11-13 13:55:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111434157] [2024-11-13 13:55:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:41,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:41,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111434157] [2024-11-13 13:55:41,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111434157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:41,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264087363] [2024-11-13 13:55:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:41,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:41,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:41,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:41,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:55:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:41,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 13:55:41,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:41,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:55:41,757 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:55:41,758 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-13 13:55:41,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:55:41,907 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-13 13:55:41,915 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-13 13:55:42,228 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-13 13:55:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 13:55:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:42,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:43,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:55:43,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 37 treesize of output 55 [2024-11-13 13:55:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264087363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:43,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:43,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 40 [2024-11-13 13:55:43,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350924432] [2024-11-13 13:55:43,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:43,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 13:55:43,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:43,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 13:55:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 13:55:43,340 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 41 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:44,882 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2024-11-13 13:55:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:55:44,883 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:55:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:44,884 INFO L225 Difference]: With dead ends: 116 [2024-11-13 13:55:44,884 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 13:55:44,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=241, Invalid=2621, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 13:55:44,886 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 91 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:44,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 780 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:55:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 13:55:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2024-11-13 13:55:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 80 states have internal predecessors, (93), 0 states have call successors, (0), 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-13 13:55:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-11-13 13:55:44,896 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 27 [2024-11-13 13:55:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:44,896 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-11-13 13:55:44,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-11-13 13:55:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 13:55:44,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:44,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:44,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 13:55:45,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:45,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:45,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -569962452, now seen corresponding path program 2 times [2024-11-13 13:55:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:45,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087301283] [2024-11-13 13:55:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:55:45,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087301283] [2024-11-13 13:55:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087301283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809440232] [2024-11-13 13:55:45,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:55:45,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:45,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:45,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:55:45,418 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:55:45,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:55:45,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:55:45,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:55:45,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:55:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809440232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:55:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-13 13:55:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827074664] [2024-11-13 13:55:45,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:45,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:55:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:55:45,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:55:45,465 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:45,513 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2024-11-13 13:55:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:55:45,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-13 13:55:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:45,514 INFO L225 Difference]: With dead ends: 68 [2024-11-13 13:55:45,514 INFO L226 Difference]: Without dead ends: 68 [2024-11-13 13:55:45,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:55:45,515 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 69 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:45,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 117 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-13 13:55:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-13 13:55:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2024-11-13 13:55:45,521 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 30 [2024-11-13 13:55:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:45,521 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2024-11-13 13:55:45,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2024-11-13 13:55:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:55:45,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:45,522 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:45,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:55:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 13:55:45,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:45,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1203147901, now seen corresponding path program 1 times [2024-11-13 13:55:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472894627] [2024-11-13 13:55:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 13:55:45,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:45,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472894627] [2024-11-13 13:55:45,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472894627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:45,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:45,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:55:45,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412643016] [2024-11-13 13:55:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:45,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:55:45,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:45,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:55:45,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:55:45,884 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 13:55:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:46,090 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2024-11-13 13:55:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:55:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 13:55:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:46,092 INFO L225 Difference]: With dead ends: 71 [2024-11-13 13:55:46,092 INFO L226 Difference]: Without dead ends: 71 [2024-11-13 13:55:46,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:55:46,093 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 204 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.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:46,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 204 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:55:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-13 13:55:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-13 13:55:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 70 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-13 13:55:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2024-11-13 13:55:46,097 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 33 [2024-11-13 13:55:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:46,097 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2024-11-13 13:55:46,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 13:55:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2024-11-13 13:55:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:55:46,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:46,098 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:46,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:55:46,098 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:46,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1203147902, now seen corresponding path program 1 times [2024-11-13 13:55:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011526164] [2024-11-13 13:55:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:55:46,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011526164] [2024-11-13 13:55:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011526164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599624136] [2024-11-13 13:55:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:46,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:46,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:46,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:46,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:55:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:46,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:55:46,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:55:46,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:55:46,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599624136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:46,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:46,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-13 13:55:46,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745712829] [2024-11-13 13:55:46,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:46,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:55:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:46,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:55:46,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:55:46,487 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 13:55:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:46,557 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-11-13 13:55:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:55:46,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 13:55:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:46,558 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:55:46,558 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:55:46,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:55:46,558 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 107 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:46,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 159 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:55:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-13 13:55:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 84 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-13 13:55:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2024-11-13 13:55:46,565 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 33 [2024-11-13 13:55:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:46,565 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-11-13 13:55:46,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 13:55:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2024-11-13 13:55:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 13:55:46,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:46,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:46,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 13:55:46,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 13:55:46,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1315350218, now seen corresponding path program 1 times [2024-11-13 13:55:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273852781] [2024-11-13 13:55:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:55:46,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273852781] [2024-11-13 13:55:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273852781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132411430] [2024-11-13 13:55:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:46,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:46,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:55:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:47,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:55:47,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:55:47,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:55:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132411430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:47,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-11-13 13:55:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725660137] [2024-11-13 13:55:47,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:47,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:55:47,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:55:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:55:47,166 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:47,269 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-11-13 13:55:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:55:47,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 13:55:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:47,270 INFO L225 Difference]: With dead ends: 88 [2024-11-13 13:55:47,270 INFO L226 Difference]: Without dead ends: 88 [2024-11-13 13:55:47,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:55:47,271 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 78 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:47,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 280 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-13 13:55:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-11-13 13:55:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.391304347826087) internal successors, (96), 79 states have internal predecessors, (96), 0 states have call successors, (0), 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-13 13:55:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-11-13 13:55:47,274 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 34 [2024-11-13 13:55:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:47,274 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-11-13 13:55:47,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-11-13 13:55:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 13:55:47,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:47,275 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:47,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 13:55:47,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 13:55:47,476 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:47,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 337131316, now seen corresponding path program 2 times [2024-11-13 13:55:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:47,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282224311] [2024-11-13 13:55:47,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:55:47,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:47,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282224311] [2024-11-13 13:55:47,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282224311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:47,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187728537] [2024-11-13 13:55:47,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:55:47,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:47,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:47,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:47,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:55:47,764 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:55:47,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:55:47,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:55:47,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 13:55:47,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:55:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187728537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:47,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:55:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-13 13:55:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919355123] [2024-11-13 13:55:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:47,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:47,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:55:47,823 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:47,873 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-13 13:55:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:55:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-13 13:55:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:47,874 INFO L225 Difference]: With dead ends: 87 [2024-11-13 13:55:47,874 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 13:55:47,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:55:47,875 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 82 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:47,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 132 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 13:55:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2024-11-13 13:55:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 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-13 13:55:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-13 13:55:47,880 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 37 [2024-11-13 13:55:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:47,880 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-13 13:55:47,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-13 13:55:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 13:55:47,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:47,881 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:47,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:55:48,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 13:55:48,082 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:48,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 337131371, now seen corresponding path program 1 times [2024-11-13 13:55:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309504865] [2024-11-13 13:55:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:55:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309504865] [2024-11-13 13:55:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309504865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:55:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998729884] [2024-11-13 13:55:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:48,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:55:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:55:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:55:48,366 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:48,578 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-11-13 13:55:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:55:48,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-13 13:55:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:48,579 INFO L225 Difference]: With dead ends: 79 [2024-11-13 13:55:48,579 INFO L226 Difference]: Without dead ends: 79 [2024-11-13 13:55:48,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:55:48,580 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:48,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 246 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:55:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-13 13:55:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-13 13:55:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-11-13 13:55:48,584 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 37 [2024-11-13 13:55:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-13 13:55:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-11-13 13:55:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:55:48,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:48,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:55:48,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1847163034, now seen corresponding path program 1 times [2024-11-13 13:55:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659691174] [2024-11-13 13:55:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:55:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659691174] [2024-11-13 13:55:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659691174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535826817] [2024-11-13 13:55:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:49,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:49,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:49,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:49,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:55:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:49,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-13 13:55:49,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:49,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:55:49,966 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:55:49,966 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-13 13:55:50,054 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-13 13:55:50,365 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:55:50,365 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-13 13:55:50,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:55:50,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-13 13:55:50,585 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-13 13:55:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:55:50,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:55,025 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 13:55:55,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 13:55:55,331 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_932) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-13 13:55:55,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_932) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2024-11-13 13:55:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-13 13:55:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535826817] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:55,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 47 [2024-11-13 13:55:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837679327] [2024-11-13 13:55:55,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-13 13:55:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-13 13:55:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1900, Unknown=41, NotChecked=178, Total=2256 [2024-11-13 13:55:55,566 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 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-13 13:55:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:57,115 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2024-11-13 13:55:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:55:57,116 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:55:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:57,117 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:55:57,117 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:55:57,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=271, Invalid=3236, Unknown=41, NotChecked=234, Total=3782 [2024-11-13 13:55:57,119 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 108 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:57,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 816 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1135 Invalid, 0 Unknown, 136 Unchecked, 0.9s Time] [2024-11-13 13:55:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:55:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2024-11-13 13:55:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.368421052631579) internal successors, (104), 86 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2024-11-13 13:55:57,126 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 40 [2024-11-13 13:55:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:57,126 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2024-11-13 13:55:57,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 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-13 13:55:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2024-11-13 13:55:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:55:57,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:57,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:57,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 13:55:57,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 13:55:57,329 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:55:57,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1847163035, now seen corresponding path program 1 times [2024-11-13 13:55:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:57,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311737525] [2024-11-13 13:55:57,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:55:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311737525] [2024-11-13 13:55:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311737525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525494612] [2024-11-13 13:55:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:58,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:58,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:55:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:59,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-13 13:55:59,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:59,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:55:59,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:55:59,332 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:55:59,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 13:55:59,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:55:59,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:55:59,522 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-13 13:55:59,529 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-13 13:56:00,073 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:56:00,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 13:56:00,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:56:00,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:00,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-13 13:56:00,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:00,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 13:56:00,343 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-13 13:56:00,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 13:56:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 13:56:00,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:00,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1048 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1048 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1048)) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1048) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1048 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1048 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1048)) (forall ((v_ArrVal_1047 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1048) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1047)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2024-11-13 13:56:01,051 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-13 13:56:01,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-13 13:56:01,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-13 13:56:01,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))))))) is different from false [2024-11-13 13:56:01,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))))) is different from false [2024-11-13 13:56:01,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-11-13 13:56:01,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:01,318 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 45 treesize of output 46 [2024-11-13 13:56:01,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:01,327 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 35 treesize of output 36 [2024-11-13 13:56:01,333 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 62 treesize of output 50 [2024-11-13 13:56:01,337 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 96 treesize of output 78 [2024-11-13 13:56:01,350 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 15 treesize of output 11 [2024-11-13 13:56:01,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:56:01,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:01,362 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 22 treesize of output 23 [2024-11-13 13:56:01,365 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:56:01,367 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 22 treesize of output 10 [2024-11-13 13:56:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-13 13:56:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525494612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:02,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:02,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 58 [2024-11-13 13:56:02,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670915457] [2024-11-13 13:56:02,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:02,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-13 13:56:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-13 13:56:02,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2492, Unknown=30, NotChecked=742, Total=3422 [2024-11-13 13:56:02,050 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:04,612 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-13 13:56:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:56:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:56:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:04,613 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:56:04,613 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:56:04,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=328, Invalid=4225, Unknown=31, NotChecked=966, Total=5550 [2024-11-13 13:56:04,615 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 151 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:04,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1297 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1485 Invalid, 0 Unknown, 471 Unchecked, 1.2s Time] [2024-11-13 13:56:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:56:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2024-11-13 13:56:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.32) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 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-13 13:56:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-13 13:56:04,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 40 [2024-11-13 13:56:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:04,618 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-13 13:56:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 59 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-13 13:56:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 13:56:04,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:04,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:04,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 13:56:04,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:04,824 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:04,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1714645459, now seen corresponding path program 2 times [2024-11-13 13:56:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:04,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486835427] [2024-11-13 13:56:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 13:56:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486835427] [2024-11-13 13:56:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486835427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:56:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960124839] [2024-11-13 13:56:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:56:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:56:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:56:04,938 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 13:56:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:04,986 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-11-13 13:56:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:56:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 43 [2024-11-13 13:56:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:04,987 INFO L225 Difference]: With dead ends: 72 [2024-11-13 13:56:04,987 INFO L226 Difference]: Without dead ends: 72 [2024-11-13 13:56:04,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:56:04,988 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:04,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 106 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:56:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-13 13:56:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-13 13:56:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-13 13:56:04,991 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 43 [2024-11-13 13:56:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:04,991 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-13 13:56:04,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 13:56:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-13 13:56:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 13:56:04,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:04,992 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:04,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:56:04,992 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash -396649798, now seen corresponding path program 1 times [2024-11-13 13:56:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268956194] [2024-11-13 13:56:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:56:06,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:06,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268956194] [2024-11-13 13:56:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268956194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038086257] [2024-11-13 13:56:06,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:06,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:06,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:06,789 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:06,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:56:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:06,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-13 13:56:06,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:07,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:56:07,261 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:56:07,261 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-13 13:56:07,437 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-13 13:56:07,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:56:08,090 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:56:08,090 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 74 treesize of output 67 [2024-11-13 13:56:08,096 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 23 treesize of output 13 [2024-11-13 13:56:08,105 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-13 13:56:08,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:08,450 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 21 [2024-11-13 13:56:08,460 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 22 treesize of output 17 [2024-11-13 13:56:08,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:08,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-11-13 13:56:08,825 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 15 [2024-11-13 13:56:08,833 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 28 treesize of output 10 [2024-11-13 13:56:09,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:56:09,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:09,005 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 15 treesize of output 10 [2024-11-13 13:56:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:56:09,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:09,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 Int)) (or (not (= v_ArrVal_1214 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1214 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (+ 1 (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1213) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1212)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2024-11-13 13:56:09,347 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_1213 (Array Int Int))) (or (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1213) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|))) is different from false [2024-11-13 13:56:09,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:09,471 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 40 treesize of output 41 [2024-11-13 13:56:09,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:09,486 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 83 treesize of output 86 [2024-11-13 13:56:09,494 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 31 treesize of output 20 [2024-11-13 13:56:10,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:10,707 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 22 treesize of output 23 [2024-11-13 13:56:10,711 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 36 treesize of output 24 [2024-11-13 13:56:10,728 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 13:56:10,729 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 24 treesize of output 1 [2024-11-13 13:56:10,736 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 13:56:10,736 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 22 treesize of output 1 [2024-11-13 13:56:10,746 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 13:56:10,746 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 23 treesize of output 1 [2024-11-13 13:56:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-13 13:56:11,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038086257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:11,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:11,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 28] total 73 [2024-11-13 13:56:11,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031031226] [2024-11-13 13:56:11,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:11,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-13 13:56:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:11,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-13 13:56:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4722, Unknown=10, NotChecked=278, Total=5256 [2024-11-13 13:56:11,467 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 73 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 73 states have internal predecessors, (122), 0 states have call successors, (0), 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-13 13:56:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:15,685 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-13 13:56:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 13:56:15,686 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 73 states have internal predecessors, (122), 0 states have call successors, (0), 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 46 [2024-11-13 13:56:15,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:15,687 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:56:15,687 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 13:56:15,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2238 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=555, Invalid=7999, Unknown=10, NotChecked=366, Total=8930 [2024-11-13 13:56:15,689 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 186 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:15,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1137 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1797 Invalid, 0 Unknown, 152 Unchecked, 1.8s Time] [2024-11-13 13:56:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 13:56:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-13 13:56:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 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-13 13:56:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-13 13:56:15,692 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 46 [2024-11-13 13:56:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:15,692 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-13 13:56:15,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 73 states have internal predecessors, (122), 0 states have call successors, (0), 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-13 13:56:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-13 13:56:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 13:56:15,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:15,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:15,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:56:15,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:15,894 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:15,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1751327028, now seen corresponding path program 1 times [2024-11-13 13:56:15,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259709609] [2024-11-13 13:56:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 13:56:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259709609] [2024-11-13 13:56:16,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259709609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327827473] [2024-11-13 13:56:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:16,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:16,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:16,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:56:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:16,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 13:56:16,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:17,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 13:56:17,335 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 24 treesize of output 12 [2024-11-13 13:56:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 13:56:17,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:17,532 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 36 treesize of output 32 [2024-11-13 13:56:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 13:56:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327827473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:17,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 22 [2024-11-13 13:56:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635432515] [2024-11-13 13:56:17,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:17,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:56:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:56:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:56:17,582 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 22 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:18,296 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-13 13:56:18,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:56:18,297 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 22 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-13 13:56:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:18,298 INFO L225 Difference]: With dead ends: 90 [2024-11-13 13:56:18,298 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 13:56:18,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 13:56:18,300 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 93 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:18,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 592 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:56:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 13:56:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2024-11-13 13:56:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 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-13 13:56:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-11-13 13:56:18,304 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 52 [2024-11-13 13:56:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:18,304 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-11-13 13:56:18,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 22 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-11-13 13:56:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-13 13:56:18,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:18,306 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:18,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:56:18,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:18,510 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:18,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1543587291, now seen corresponding path program 1 times [2024-11-13 13:56:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:18,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038471834] [2024-11-13 13:56:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 13:56:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038471834] [2024-11-13 13:56:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038471834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:18,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:56:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422211373] [2024-11-13 13:56:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:18,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:56:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:56:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:56:18,658 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 13:56:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:18,772 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-13 13:56:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:56:18,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 53 [2024-11-13 13:56:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:18,773 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:56:18,774 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 13:56:18,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:56:18,774 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:18,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:56:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 13:56:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-13 13:56:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-13 13:56:18,782 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 53 [2024-11-13 13:56:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:18,783 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-13 13:56:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 13:56:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-13 13:56:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-13 13:56:18,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:18,784 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:18,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 13:56:18,784 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:18,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1543587292, now seen corresponding path program 1 times [2024-11-13 13:56:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483438900] [2024-11-13 13:56:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:56:19,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:19,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483438900] [2024-11-13 13:56:19,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483438900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:19,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:19,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:56:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560902774] [2024-11-13 13:56:19,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:19,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:56:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:56:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:56:19,169 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:19,516 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-13 13:56:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:56:19,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-13 13:56:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:19,518 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:56:19,518 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:56:19,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:56:19,519 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:19,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 191 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:56:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:56:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-13 13:56:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.162162162162162) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 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-13 13:56:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-13 13:56:19,525 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 53 [2024-11-13 13:56:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:19,525 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-13 13:56:19,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-13 13:56:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 13:56:19,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:19,526 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:19,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 13:56:19,527 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:19,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 606564356, now seen corresponding path program 1 times [2024-11-13 13:56:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052858218] [2024-11-13 13:56:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:56:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052858218] [2024-11-13 13:56:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052858218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:19,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:56:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435722172] [2024-11-13 13:56:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:19,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:56:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:56:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:56:19,734 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:19,964 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-13 13:56:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:56:19,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-13 13:56:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:19,966 INFO L225 Difference]: With dead ends: 82 [2024-11-13 13:56:19,966 INFO L226 Difference]: Without dead ends: 82 [2024-11-13 13:56:19,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:56:19,967 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:19,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 237 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:56:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-13 13:56:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-13 13:56:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-13 13:56:19,971 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 54 [2024-11-13 13:56:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:19,971 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-13 13:56:19,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-13 13:56:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 13:56:19,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:19,973 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:19,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 13:56:19,974 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash -892311583, now seen corresponding path program 2 times [2024-11-13 13:56:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213357561] [2024-11-13 13:56:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:56:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213357561] [2024-11-13 13:56:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213357561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886050379] [2024-11-13 13:56:20,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:56:20,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:20,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:20,179 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:20,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:56:20,482 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:56:20,482 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:56:20,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:56:20,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:56:20,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:56:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886050379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:20,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-13 13:56:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370104302] [2024-11-13 13:56:20,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:20,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:56:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:56:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:56:20,746 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:20,897 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-13 13:56:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:56:20,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-13 13:56:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:20,899 INFO L225 Difference]: With dead ends: 77 [2024-11-13 13:56:20,899 INFO L226 Difference]: Without dead ends: 77 [2024-11-13 13:56:20,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:56:20,899 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:20,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 187 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:56:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-13 13:56:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-13 13:56:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 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-13 13:56:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-13 13:56:20,907 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 55 [2024-11-13 13:56:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:20,907 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-13 13:56:20,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-13 13:56:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 13:56:20,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:20,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:20,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 13:56:21,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:21,109 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:21,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1205764643, now seen corresponding path program 1 times [2024-11-13 13:56:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:21,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102487200] [2024-11-13 13:56:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:21,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:56:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102487200] [2024-11-13 13:56:21,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102487200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:21,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:56:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748736433] [2024-11-13 13:56:21,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:21,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:56:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:21,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:56:21,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:56:21,353 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:21,617 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2024-11-13 13:56:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:56:21,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-13 13:56:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:21,618 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:56:21,618 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 13:56:21,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:56:21,619 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:21,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 221 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:56:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 13:56:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-13 13:56:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-13 13:56:21,622 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 56 [2024-11-13 13:56:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:21,622 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-13 13:56:21,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-13 13:56:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 13:56:21,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:21,624 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:21,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 13:56:21,624 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:21,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash -234140322, now seen corresponding path program 3 times [2024-11-13 13:56:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716731390] [2024-11-13 13:56:21,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:21,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:56:21,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716731390] [2024-11-13 13:56:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716731390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:21,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982341006] [2024-11-13 13:56:21,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:56:21,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:21,809 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:21,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:56:22,147 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 13:56:22,147 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:56:22,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:56:22,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:56:22,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:56:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982341006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:22,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:56:22,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2024-11-13 13:56:22,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302415500] [2024-11-13 13:56:22,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:22,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:56:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:22,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:56:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:56:22,267 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:22,338 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2024-11-13 13:56:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:56:22,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-13 13:56:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:22,340 INFO L225 Difference]: With dead ends: 69 [2024-11-13 13:56:22,340 INFO L226 Difference]: Without dead ends: 69 [2024-11-13 13:56:22,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:56:22,341 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:22,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:56:22,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-13 13:56:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-13 13:56:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.09375) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 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-13 13:56:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2024-11-13 13:56:22,346 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 58 [2024-11-13 13:56:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2024-11-13 13:56:22,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2024-11-13 13:56:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 13:56:22,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:22,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:22,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:56:22,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:56:22,548 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:22,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2122830560, now seen corresponding path program 1 times [2024-11-13 13:56:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596244096] [2024-11-13 13:56:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 13:56:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596244096] [2024-11-13 13:56:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596244096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151759371] [2024-11-13 13:56:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:24,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:24,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:24,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:56:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:24,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-13 13:56:24,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:24,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:56:24,399 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-13 13:56:24,517 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-13 13:56:24,883 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:56:24,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 13:56:24,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:24,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 13:56:25,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:25,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-13 13:56:25,403 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:56:25,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 13:56:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:56:25,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:26,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:26,241 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 45 treesize of output 49 [2024-11-13 13:56:26,322 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1844 Int)) (or (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1844) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) 4) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2)))) is different from false [2024-11-13 13:56:26,362 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1844 Int)) (or (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1844) 4)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) 4) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2)))) is different from false [2024-11-13 13:56:26,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) 4) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1844 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1844) 4)))))) is different from false [2024-11-13 13:56:26,449 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1844 Int)) (or (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1844) 4)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))))) is different from false [2024-11-13 13:56:27,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_prenex_2) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_3) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_4) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1844 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1844) 4) .cse0))))) is different from false [2024-11-13 13:56:27,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:27,025 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 23 treesize of output 24 [2024-11-13 13:56:27,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-13 13:56:27,039 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 22 treesize of output 20 [2024-11-13 13:56:27,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:27,063 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 32 treesize of output 34 [2024-11-13 13:56:27,143 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:56:27,144 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 22 treesize of output 1 [2024-11-13 13:56:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2024-11-13 13:56:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151759371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:27,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:27,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2024-11-13 13:56:27,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279148237] [2024-11-13 13:56:27,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:27,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-13 13:56:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:27,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-13 13:56:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1818, Unknown=26, NotChecked=450, Total=2450 [2024-11-13 13:56:27,303 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 50 states, 49 states have (on average 2.4081632653061225) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 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-13 13:56:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:29,678 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2024-11-13 13:56:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:56:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.4081632653061225) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 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 59 [2024-11-13 13:56:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:29,680 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:56:29,684 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 13:56:29,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=277, Invalid=3137, Unknown=28, NotChecked=590, Total=4032 [2024-11-13 13:56:29,690 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:29,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 522 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1199 Invalid, 0 Unknown, 317 Unchecked, 1.4s Time] [2024-11-13 13:56:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 13:56:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-13 13:56:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-13 13:56:29,699 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2024-11-13 13:56:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:29,699 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-13 13:56:29,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.4081632653061225) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 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-13 13:56:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-13 13:56:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 13:56:29,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:29,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:29,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 13:56:29,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 13:56:29,901 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:29,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2122830559, now seen corresponding path program 1 times [2024-11-13 13:56:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956292219] [2024-11-13 13:56:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:29,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 13:56:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:31,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956292219] [2024-11-13 13:56:31,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956292219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:31,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735274424] [2024-11-13 13:56:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:31,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:31,825 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:31,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:56:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:32,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-13 13:56:32,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:32,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:56:32,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:56:32,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:56:32,240 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-13 13:56:32,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:56:32,315 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-13 13:56:32,327 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-13 13:56:32,674 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:56:32,674 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-13 13:56:32,684 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-13 13:56:32,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:32,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:56:32,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:32,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 13:56:33,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:33,274 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 17 treesize of output 15 [2024-11-13 13:56:33,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:33,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-13 13:56:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:56:33,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:34,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1962 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1962 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1962)) (forall ((v_ArrVal_1960 Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1962) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1960)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_1962 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1962 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1962)) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1962) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2024-11-13 13:56:34,339 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1960 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1960) 4))))) (forall ((v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1959 (Array Int Int))) (or (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4) 5)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|)))) is different from false [2024-11-13 13:56:34,407 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1960 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1960) 4))))) (forall ((v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1959 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)))))) is different from false [2024-11-13 13:56:34,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1959 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4) 5)))) (forall ((v_ArrVal_1960 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1960) 4))))))) is different from false [2024-11-13 13:56:34,519 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1960 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1960) 4))))) (forall ((v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1959 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4))))))) is different from false [2024-11-13 13:56:34,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1960 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1960) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))) (forall ((v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1959 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4))))))) is different from false [2024-11-13 13:56:34,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1960 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1960) 4))))) (forall ((v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1959 (Array Int Int))) (or (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4) 5)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))))) is different from false [2024-11-13 13:56:34,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1960 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1960) 4))))) (forall ((v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1959 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4))))))) is different from false [2024-11-13 13:56:34,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:34,683 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-13 13:56:34,693 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 42 treesize of output 38 [2024-11-13 13:56:34,703 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 26 treesize of output 24 [2024-11-13 13:56:34,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:34,725 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 36 treesize of output 38 [2024-11-13 13:56:34,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:34,803 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 43 treesize of output 44 [2024-11-13 13:56:34,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:34,817 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 35 treesize of output 36 [2024-11-13 13:56:34,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:56:34,825 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 33 treesize of output 29 [2024-11-13 13:56:34,830 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:56:34,833 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 28 treesize of output 24 [2024-11-13 13:56:34,838 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:56:34,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-13 13:56:34,848 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:56:34,851 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-13 13:56:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2024-11-13 13:56:35,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735274424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:35,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:35,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 54 [2024-11-13 13:56:35,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086280258] [2024-11-13 13:56:35,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:35,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-13 13:56:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:35,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-13 13:56:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2008, Unknown=8, NotChecked=776, Total=2970 [2024-11-13 13:56:35,797 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 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-13 13:56:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:38,661 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2024-11-13 13:56:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 13:56:38,662 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 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 59 [2024-11-13 13:56:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:38,663 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:56:38,663 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:56:38,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=293, Invalid=3271, Unknown=8, NotChecked=984, Total=4556 [2024-11-13 13:56:38,664 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:38,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 584 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1308 Invalid, 0 Unknown, 531 Unchecked, 1.4s Time] [2024-11-13 13:56:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:56:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-13 13:56:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 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-13 13:56:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-13 13:56:38,668 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2024-11-13 13:56:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:38,668 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-13 13:56:38,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 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-13 13:56:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-13 13:56:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 13:56:38,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:38,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:38,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 13:56:38,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:38,871 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:38,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1383239329, now seen corresponding path program 1 times [2024-11-13 13:56:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398184832] [2024-11-13 13:56:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 13:56:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:40,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398184832] [2024-11-13 13:56:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398184832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:40,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47989526] [2024-11-13 13:56:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:40,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:40,552 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:40,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:56:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:40,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-13 13:56:40,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:41,757 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-13 13:56:42,956 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-13 13:56:42,957 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 55 treesize of output 54 [2024-11-13 13:56:42,982 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 36 treesize of output 26 [2024-11-13 13:56:43,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:43,389 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 69 treesize of output 45 [2024-11-13 13:56:44,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:44,160 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 63 treesize of output 49 [2024-11-13 13:56:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:56:45,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:47,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:47,959 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 24 treesize of output 25 [2024-11-13 13:56:47,964 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 41 treesize of output 37 [2024-11-13 13:56:47,972 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 39 treesize of output 37 [2024-11-13 13:56:47,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:47,987 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 57 treesize of output 59 [2024-11-13 13:56:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:56:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47989526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:49,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:49,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 25] total 71 [2024-11-13 13:56:49,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356430467] [2024-11-13 13:56:49,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:49,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-13 13:56:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-13 13:56:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=4682, Unknown=24, NotChecked=0, Total=4970 [2024-11-13 13:56:49,631 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 71 states, 71 states have (on average 2.23943661971831) internal successors, (159), 71 states have internal predecessors, (159), 0 states have call successors, (0), 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-13 13:56:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:55,680 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2024-11-13 13:56:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 13:56:55,681 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.23943661971831) internal successors, (159), 71 states have internal predecessors, (159), 0 states have call successors, (0), 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 60 [2024-11-13 13:56:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:55,682 INFO L225 Difference]: With dead ends: 128 [2024-11-13 13:56:55,682 INFO L226 Difference]: Without dead ends: 128 [2024-11-13 13:56:55,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=546, Invalid=9732, Unknown=24, NotChecked=0, Total=10302 [2024-11-13 13:56:55,686 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 146 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:55,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 762 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1793 Invalid, 3 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 13:56:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-13 13:56:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 74. [2024-11-13 13:56:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-13 13:56:55,690 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2024-11-13 13:56:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:55,690 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-13 13:56:55,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.23943661971831) internal successors, (159), 71 states have internal predecessors, (159), 0 states have call successors, (0), 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-13 13:56:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-11-13 13:56:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 13:56:55,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:55,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:55,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-13 13:56:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:55,892 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:56:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2146659208, now seen corresponding path program 1 times [2024-11-13 13:56:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914031403] [2024-11-13 13:56:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:56:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914031403] [2024-11-13 13:56:57,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914031403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909213586] [2024-11-13 13:56:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:57,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:57,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:57,797 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:57,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 13:56:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:58,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 13:56:58,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:58,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:56:58,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:56:58,267 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-13 13:56:58,328 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-13 13:56:58,648 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:56:58,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 13:56:58,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:58,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 13:56:59,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:56:59,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-13 13:56:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 13:56:59,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:59,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2184 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2184) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2186) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-13 13:56:59,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2184 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2184) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2186) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-13 13:57:00,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2184 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2184) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2186) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-13 13:57:00,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2184 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2184) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2186) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-13 13:57:00,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2184 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2184) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2186) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-13 13:57:00,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:00,233 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 23 treesize of output 24 [2024-11-13 13:57:00,238 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 38 treesize of output 34 [2024-11-13 13:57:00,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 26 treesize of output 24 [2024-11-13 13:57:00,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:00,268 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 36 treesize of output 38 [2024-11-13 13:57:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2024-11-13 13:57:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909213586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:00,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:57:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2024-11-13 13:57:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682121241] [2024-11-13 13:57:00,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:00,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-13 13:57:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 13:57:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1702, Unknown=43, NotChecked=440, Total=2352 [2024-11-13 13:57:00,724 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 49 states, 48 states have (on average 2.6875) internal successors, (129), 49 states have internal predecessors, (129), 0 states have call successors, (0), 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-13 13:57:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:03,006 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2024-11-13 13:57:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 13:57:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.6875) internal successors, (129), 49 states have internal predecessors, (129), 0 states have call successors, (0), 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 62 [2024-11-13 13:57:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:03,007 INFO L225 Difference]: With dead ends: 81 [2024-11-13 13:57:03,007 INFO L226 Difference]: Without dead ends: 81 [2024-11-13 13:57:03,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=277, Invalid=3004, Unknown=45, NotChecked=580, Total=3906 [2024-11-13 13:57:03,008 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:03,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 640 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1136 Invalid, 0 Unknown, 326 Unchecked, 1.2s Time] [2024-11-13 13:57:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-13 13:57:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-13 13:57:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 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-13 13:57:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-13 13:57:03,015 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2024-11-13 13:57:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:03,015 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-13 13:57:03,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.6875) internal successors, (129), 49 states have internal predecessors, (129), 0 states have call successors, (0), 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-13 13:57:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-13 13:57:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 13:57:03,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:57:03,017 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:57:03,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 13:57:03,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:03,218 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:57:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash 938724517, now seen corresponding path program 2 times [2024-11-13 13:57:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329119140] [2024-11-13 13:57:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:03,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:57:06,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329119140] [2024-11-13 13:57:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329119140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:57:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520156486] [2024-11-13 13:57:06,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:57:06,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:57:06,075 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:57:06,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:57:06,468 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:57:06,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:57:06,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-13 13:57:06,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:57:06,742 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-13 13:57:06,756 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-13 13:57:06,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:57:06,915 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-13 13:57:07,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:57:07,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:57:07,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:57:07,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:57:07,294 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 15 [2024-11-13 13:57:07,307 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 15 [2024-11-13 13:57:08,198 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2024-11-13 13:57:08,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2024-11-13 13:57:08,331 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-11-13 13:57:08,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2024-11-13 13:57:09,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:09,801 INFO L349 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2024-11-13 13:57:09,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 189 treesize of output 179 [2024-11-13 13:57:09,880 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-13 13:57:09,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 144 [2024-11-13 13:57:10,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:57:10,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:57:10,932 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:57:10,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 13:57:11,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:57:28,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:57:28,858 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-13 13:57:28,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 43 [2024-11-13 13:57:28,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:28,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-13 13:57:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:57:28,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:57:29,080 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 10 treesize of output 8 [2024-11-13 13:57:35,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select .cse2 .cse1) 4) 0))))) (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (not (= v_ArrVal_2303 (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2303) .cse5) 4) 0))))))) is different from false [2024-11-13 13:57:35,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))))) (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2303) .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))))))) is different from false [2024-11-13 13:57:35,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2303) .cse0) 4) 0)))) (forall ((v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) (= (select (select .cse5 .cse4) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))) is different from false [2024-11-13 13:57:35,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2303) .cse1) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select .cse5 .cse4) 4) 0)))))))) is different from false [2024-11-13 13:57:35,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse1 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse6 4)) (.cse5 (select .cse4 .cse1))) (and (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse6)) (.cse2 (select (select (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (not (= v_ArrVal_2303 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store .cse0 .cse1 v_ArrVal_2303) .cse2) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse8 (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7) (= (select (select .cse8 .cse7) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))) is different from false [2024-11-13 13:57:35,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse2 (select .cse10 4)) (.cse4 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse4 4)) (.cse6 (select .cse5 .cse2))) (and (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (select (select (store .cse5 .cse2 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_node_create_#res#1.base|) 4)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse4))) (or (= |c_ULTIMATE.start_node_create_#res#1.base| .cse0) (= (select (select (store .cse1 .cse2 v_ArrVal_2303) .cse0) 4) 0) (not (= (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse7 (store .cse5 .cse2 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (= (select (select .cse7 .cse8) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))) is different from false [2024-11-13 13:57:35,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))))) (forall ((v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse7 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8))) (or (= (select (select (store .cse6 .cse4 v_ArrVal_2303) .cse7) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse7) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2303 (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))))) is different from false [2024-11-13 13:57:35,570 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-13 13:57:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 118 [2024-11-13 13:57:35,638 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-13 13:57:35,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 180 [2024-11-13 13:57:36,378 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-13 13:57:36,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 158 [2024-11-13 13:57:36,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-13 13:57:37,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (or (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18)) (.cse4 (select v_arrayElimArr_18 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select .cse1 .cse2) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse2))))) .cse5) (or .cse5 (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (let ((.cse8 (let ((.cse10 (select v_arrayElimArr_18 4))) (store .cse7 .cse10 (store (select .cse7 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse6 (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse8 .cse9) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse9))))))) (or (and (forall ((v_ArrVal_2303 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse13 (select v_arrayElimArr_17 4))) (or (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (not (= (store (select .cse12 .cse13) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (= (select (select (store .cse12 .cse13 v_ArrVal_2303) (select (select (store .cse11 .cse13 (store (select .cse11 .cse13) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse0)))))) (forall ((v_ArrVal_2303 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse16 (select v_arrayElimArr_17 4))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse14 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse17 .cse16 (store (select .cse17 .cse16) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse14) (not (= (store (select .cse15 .cse16) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (= (select (select (store .cse15 .cse16 v_ArrVal_2303) .cse14) 4) 0) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse0)))))))) .cse5) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_ArrVal_2304 Int)) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (let ((.cse18 (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select .cse18 .cse19) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse19) (= (select (let ((.cse20 (let ((.cse22 (select v_arrayElimArr_18 4))) (store .cse21 .cse22 (store (select .cse21 .cse22) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse5 (forall ((v_ArrVal_2303 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse25 (select v_arrayElimArr_17 4))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse23 (select (select (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse26 .cse25 (store (select .cse26 .cse25) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse23) (not (= (store (select .cse24 .cse25) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select (store .cse24 .cse25 v_ArrVal_2303) .cse23) 4) 0) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse0)))))))) (or (forall ((v_ArrVal_2303 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse29 (select v_arrayElimArr_17 4))) (or (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (not (= (store (select .cse28 .cse29) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2303)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select (store .cse28 .cse29 v_ArrVal_2303) (select (select (store .cse27 .cse29 (store (select .cse27 .cse29) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse0)))))) .cse5) (or (not .cse5) (forall ((v_ArrVal_2303 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse31 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse30 (select (select (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse30) (not (= v_ArrVal_2303 (store (select .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select (store .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2303) .cse30) 4) 0) (not (= (select v_arrayElimArr_16 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 4))))))) (or (and (forall ((v_arrayElimArr_18 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (forall ((v_ArrVal_2304 Int)) (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (let ((.cse33 (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select .cse33 .cse34) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse34) (= (select (let ((.cse35 (let ((.cse37 (select v_arrayElimArr_18 4))) (store .cse36 .cse37 (store (select .cse36 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse38 (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18)) (.cse41 (select v_arrayElimArr_18 4))) (store .cse40 .cse41 (store (select .cse40 .cse41) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select .cse38 .cse39) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse39))))) (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse43 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (let ((.cse44 (let ((.cse46 (select v_arrayElimArr_18 4))) (store .cse43 .cse46 (store (select .cse43 .cse46) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))))) (let ((.cse45 (select (select .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse42 (store .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304)))) (select .cse42 (select (select .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse44 .cse45) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse45))))))) .cse5))) is different from false [2024-11-13 13:57:38,887 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_81| Int) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_81| v_arrayElimArr_18))) (store .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))))) (let ((.cse0 (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_81|) 4))) (or (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_18 4))) (= .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_81|) (= (select (select .cse1 .cse0) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_81|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))))) (forall ((v_ArrVal_2303 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_81| Int) (v_ArrVal_2304 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_81| v_arrayElimArr_16)) (.cse3 (select v_arrayElimArr_16 4)) (.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_81| v_arrayElimArr_17))) (store .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2304))) |v_ULTIMATE.start_node_create_~temp~0#1.base_81|) 4))) (or (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2303 (store (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2303 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2303) .cse5) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_81|) 0)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_17 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse3) (= .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_81|))))) is different from false [2024-11-13 13:57:39,064 INFO L349 Elim1Store]: treesize reduction 34, result has 64.2 percent of original size [2024-11-13 13:57:39,065 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 531 treesize of output 466 [2024-11-13 13:57:39,196 INFO L349 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2024-11-13 13:57:39,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 575 treesize of output 588 [2024-11-13 13:57:39,343 INFO L349 Elim1Store]: treesize reduction 44, result has 63.3 percent of original size [2024-11-13 13:57:39,344 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 604 treesize of output 640 [2024-11-13 13:57:39,367 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 521 treesize of output 489 [2024-11-13 13:57:39,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:39,445 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 454 treesize of output 468 [2024-11-13 13:57:39,533 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 13:57:39,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 374 treesize of output 383 [2024-11-13 13:57:39,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:39,622 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 370 treesize of output 388 [2024-11-13 13:57:39,723 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 606 treesize of output 572 [2024-11-13 13:57:40,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:40,691 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 69 treesize of output 71 [2024-11-13 13:57:40,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:40,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-11-13 13:57:40,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:40,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2024-11-13 13:57:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2024-11-13 13:57:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520156486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:40,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:57:40,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 72 [2024-11-13 13:57:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783134509] [2024-11-13 13:57:40,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:40,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-11-13 13:57:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-11-13 13:57:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3674, Unknown=18, NotChecked=1170, Total=5112 [2024-11-13 13:57:40,869 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 72 states, 72 states have (on average 2.111111111111111) internal successors, (152), 72 states have internal predecessors, (152), 0 states have call successors, (0), 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-13 13:57:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:44,912 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2024-11-13 13:57:44,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 13:57:44,912 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.111111111111111) internal successors, (152), 72 states have internal predecessors, (152), 0 states have call successors, (0), 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 65 [2024-11-13 13:57:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:44,913 INFO L225 Difference]: With dead ends: 130 [2024-11-13 13:57:44,913 INFO L226 Difference]: Without dead ends: 130 [2024-11-13 13:57:44,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=358, Invalid=5210, Unknown=18, NotChecked=1386, Total=6972 [2024-11-13 13:57:44,914 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:44,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1194 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1586 Invalid, 0 Unknown, 618 Unchecked, 2.0s Time] [2024-11-13 13:57:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-13 13:57:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2024-11-13 13:57:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.056910569105691) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 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-13 13:57:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2024-11-13 13:57:44,918 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 65 [2024-11-13 13:57:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:44,918 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2024-11-13 13:57:44,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.111111111111111) internal successors, (152), 72 states have internal predecessors, (152), 0 states have call successors, (0), 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-13 13:57:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2024-11-13 13:57:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 13:57:44,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:57:44,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:57:44,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 13:57:45,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:45,120 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 13:57:45,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash -964312454, now seen corresponding path program 2 times [2024-11-13 13:57:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429081806] [2024-11-13 13:57:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:57:46,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429081806] [2024-11-13 13:57:46,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429081806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:57:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365661858] [2024-11-13 13:57:46,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:57:46,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:46,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:57:46,797 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:57:46,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:57:47,087 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:57:47,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:57:47,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-13 13:57:47,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:57:47,195 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-13 13:57:47,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-13 13:57:47,450 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-13 13:57:48,049 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-13 13:57:48,049 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 53 treesize of output 54 [2024-11-13 13:57:48,058 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:57:48,058 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 34 treesize of output 28 [2024-11-13 13:57:48,412 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 13:57:48,412 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 75 treesize of output 59 [2024-11-13 13:57:49,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:49,204 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 69 treesize of output 59 [2024-11-13 13:57:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 13:57:50,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:57:51,039 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2421 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) v_ArrVal_2421) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-13 13:57:51,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2421 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) v_ArrVal_2421) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-13 13:57:51,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2421 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) v_ArrVal_2421) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-13 13:57:51,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2421 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) v_ArrVal_2421) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-13 13:57:51,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:51,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2024-11-13 13:57:51,095 INFO L349 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2024-11-13 13:57:51,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 73 [2024-11-13 13:57:51,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:51,106 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 117 treesize of output 107 [2024-11-13 13:57:51,111 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 86 treesize of output 82 [2024-11-13 13:57:55,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0))) (let ((.cse2 (forall ((v_arrayElimCell_171 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_171 0) v_antiDerIndex_entry0_1)))) (.cse0 (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (.cse6 (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse4 (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (or .cse0 (and (forall ((v_arrayElimCell_169 Int)) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_arrayElimCell_169) (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_169 0) v_antiDerIndex_entry0_1))))) .cse2)) (or .cse0 (forall ((v_arrayElimCell_171 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_169 Int)) (let ((.cse3 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse3 (select (store .cse1 v_arrayElimCell_171 0) v_antiDerIndex_entry0_1)) (= .cse3 (select (store .cse1 v_arrayElimCell_169 0) v_antiDerIndex_entry0_1)))))) (or (not .cse4) .cse2) (forall ((v_arrayElimCell_171 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse5 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse5 (select .cse6 v_antiDerIndex_entry0_1)) (= .cse5 (select (store .cse1 v_arrayElimCell_171 0) v_antiDerIndex_entry0_1))))) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_169 Int)) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_arrayElimCell_169) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_169 0) v_antiDerIndex_entry0_1)))) .cse0) (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse6 v_antiDerIndex_entry0_1)))) .cse4)))) is different from false [2024-11-13 14:00:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-13 14:00:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365661858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:00:32,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:00:32,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 64 [2024-11-13 14:00:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908062577] [2024-11-13 14:00:32,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:00:32,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-13 14:00:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:00:32,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-13 14:00:32,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3323, Unknown=36, NotChecked=600, Total=4160 [2024-11-13 14:00:32,033 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 65 states, 64 states have (on average 2.515625) internal successors, (161), 65 states have internal predecessors, (161), 0 states have call successors, (0), 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-13 14:00:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:00:40,765 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2024-11-13 14:00:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 14:00:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.515625) internal successors, (161), 65 states have internal predecessors, (161), 0 states have call successors, (0), 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 66 [2024-11-13 14:00:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:00:40,768 INFO L225 Difference]: With dead ends: 130 [2024-11-13 14:00:40,768 INFO L226 Difference]: Without dead ends: 83 [2024-11-13 14:00:40,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 169.0s TimeCoverageRelationStatistics Valid=300, Invalid=4795, Unknown=37, NotChecked=720, Total=5852 [2024-11-13 14:00:40,769 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:00:40,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1003 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1751 Invalid, 0 Unknown, 370 Unchecked, 2.9s Time] [2024-11-13 14:00:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-13 14:00:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-13 14:00:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 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-13 14:00:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2024-11-13 14:00:40,773 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 66 [2024-11-13 14:00:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:00:40,773 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2024-11-13 14:00:40,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.515625) internal successors, (161), 65 states have internal predecessors, (161), 0 states have call successors, (0), 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-13 14:00:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2024-11-13 14:00:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 14:00:40,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:00:40,774 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:00:40,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 14:00:40,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-13 14:00:40,975 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-13 14:00:40,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:00:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1878196617, now seen corresponding path program 3 times [2024-11-13 14:00:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:00:40,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122487467] [2024-11-13 14:00:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:00:40,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:00:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:00:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 14:00:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:00:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122487467] [2024-11-13 14:00:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122487467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:00:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410518821] [2024-11-13 14:00:41,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:00:41,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:00:41,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:00:41,120 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:00:41,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 14:00:41,791 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 14:00:41,791 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:00:41,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:00:41,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:00:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 14:00:41,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:00:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410518821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:00:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:00:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-13 14:00:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121572291] [2024-11-13 14:00:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:00:41,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:00:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:00:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:00:41,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:00:41,835 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:00:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:00:41,850 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-13 14:00:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:00:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-13 14:00:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:00:41,851 INFO L225 Difference]: With dead ends: 19 [2024-11-13 14:00:41,851 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:00:41,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:00:41,851 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:00:41,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:00:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:00:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:00:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:00:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:00:41,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2024-11-13 14:00:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:00:41,852 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:00:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:00:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:00:41,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:00:41,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-13 14:00:41,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-13 14:00:41,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-13 14:00:41,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-13 14:00:41,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2024-11-13 14:00:41,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-13 14:00:41,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 14:00:42,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 14:00:42,060 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:00:42,062 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:00:42,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:00:42 BoogieIcfgContainer [2024-11-13 14:00:42,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:00:42,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:00:42,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:00:42,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:00:42,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:55:33" (3/4) ... [2024-11-13 14:00:42,068 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:00:42,078 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-13 14:00:42,079 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-13 14:00:42,079 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:00:42,079 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:00:42,160 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:00:42,160 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:00:42,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:00:42,161 INFO L158 Benchmark]: Toolchain (without parser) took 309382.03ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 91.5MB in the beginning and 458.5MB in the end (delta: -367.0MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-11-13 14:00:42,161 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:00:42,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.62ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:00:42,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.03ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 72.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:00:42,162 INFO L158 Benchmark]: Boogie Preprocessor took 63.40ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:00:42,163 INFO L158 Benchmark]: RCFGBuilder took 539.19ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 51.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:00:42,164 INFO L158 Benchmark]: TraceAbstraction took 308208.01ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 51.2MB in the beginning and 466.3MB in the end (delta: -415.1MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-13 14:00:42,164 INFO L158 Benchmark]: Witness Printer took 95.66ms. Allocated memory is still 536.9MB. Free memory was 466.3MB in the beginning and 458.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:00:42,165 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.62ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.03ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 72.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.40ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 539.19ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 51.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 308208.01ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 51.2MB in the beginning and 466.3MB in the end (delta: -415.1MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Witness Printer took 95.66ms. Allocated memory is still 536.9MB. Free memory was 466.3MB in the beginning and 458.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 308.2s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1771 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1771 mSDsluCounter, 13629 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2921 IncrementalHoareTripleChecker+Unchecked, 12235 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17386 IncrementalHoareTripleChecker+Invalid, 20478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 1394 mSDtfsCounter, 17386 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2321 GetRequests, 1314 SyntacticMatches, 52 SemanticMatches, 955 ConstructedPredicates, 43 IntricatePredicates, 1 DeprecatedPredicates, 10624 ImplicationChecksByTransitivity, 225.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=33, InterpolantAutomatonStates: 463, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 210 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 256.2s InterpolantComputationTime, 2315 NumberOfCodeBlocks, 2288 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2985 ConstructedInterpolants, 271 QuantifiedInterpolants, 67752 SizeOfPredicates, 91 NumberOfNonLiveVariables, 6777 ConjunctsInSsa, 965 ConjunctsInUnsatCore, 71 InterpolantComputations, 19 PerfectInterpolantSequences, 910/1544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 14:00:42,387 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 14:00:42,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1410efc-ed3e-4734-9cc1-08305f12d151/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE