./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.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_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/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_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/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_683dbb21-098b-483d-a362-dd47d4641035/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:20:03,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:20:03,618 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:20:03,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:20:03,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:20:03,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:20:03,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:20:03,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:20:03,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:20:03,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:20:03,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:20:03,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:20:03,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:20:03,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:20:03,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:20:03,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:20:03,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:20:03,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:20:03,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:20:03,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:20:03,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:20:03,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:20:03,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:20:03,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:20:03,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:20:03,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:20:03,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:20:03,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:20:03,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:20:03,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:20:03,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:20:03,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:20:03,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:20:03,675 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_683dbb21-098b-483d-a362-dd47d4641035/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-13 13:20:04,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:20:04,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:20:04,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:20:04,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:20:04,016 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:20:04,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i Unable to find full path for "g++" [2024-11-13 13:20:06,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:20:06,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:20:06,501 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2024-11-13 13:20:06,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/data/0fc050350/a4ee2b563c3741949c50731a647e614b/FLAG596ffff8d [2024-11-13 13:20:06,548 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/data/0fc050350/a4ee2b563c3741949c50731a647e614b [2024-11-13 13:20:06,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:20:06,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:20:06,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:20:06,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:20:06,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:20:06,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:20:06" (1/1) ... [2024-11-13 13:20:06,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b58b38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:06, skipping insertion in model container [2024-11-13 13:20:06,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:20:06" (1/1) ... [2024-11-13 13:20:06,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:20:07,266 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,314 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,320 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,329 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,344 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,395 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,396 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,399 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,400 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:20:07,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:20:07,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:20:07,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:20:07,668 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:20:07,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07 WrapperNode [2024-11-13 13:20:07,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:20:07,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:20:07,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:20:07,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:20:07,682 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:20:07" (1/1) ... [2024-11-13 13:20:07,725 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:20:07" (1/1) ... [2024-11-13 13:20:07,824 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-13 13:20:07,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:20:07,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:20:07,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:20:07,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:20:07,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:07,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:07,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:07,945 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [34, 2, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2024-11-13 13:20:07,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:07,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:08,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:08,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:08,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:08,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:08,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:20:08,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:20:08,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:20:08,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:20:08,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:08,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:20:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:08,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/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:20:08,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/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:20:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 13:20:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 13:20:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-13 13:20:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 13:20:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 13:20:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-13 13:20:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:20:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:20:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:20:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:20:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:20:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:20:08,378 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:20:08,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:20:08,384 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 13:20:08,447 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 13:20:08,477 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 13:20:11,187 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-13 13:20:11,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:20:11,219 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:20:11,219 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-13 13:20:11,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:20:11 BoogieIcfgContainer [2024-11-13 13:20:11,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:20:11,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:20:11,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:20:11,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:20:11,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:20:06" (1/3) ... [2024-11-13 13:20:11,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258d699a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:20:11, skipping insertion in model container [2024-11-13 13:20:11,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07" (2/3) ... [2024-11-13 13:20:11,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258d699a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:20:11, skipping insertion in model container [2024-11-13 13:20:11,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:20:11" (3/3) ... [2024-11-13 13:20:11,229 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2024-11-13 13:20:11,247 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:20:11,249 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 1063 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-11-13 13:20:11,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:20:11,316 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;@7edd65fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:20:11,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-13 13:20:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 13:20:11,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:11,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 13:20:11,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:11,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1758810, now seen corresponding path program 1 times [2024-11-13 13:20:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:11,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312135557] [2024-11-13 13:20:11,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:11,610 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:20:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:11,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312135557] [2024-11-13 13:20:11,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312135557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:11,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:11,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150782153] [2024-11-13 13:20:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:11,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:11,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:11,648 INFO L87 Difference]: Start difference. First operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:12,969 INFO L93 Difference]: Finished difference Result 1349 states and 1602 transitions. [2024-11-13 13:20:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 13:20:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:12,989 INFO L225 Difference]: With dead ends: 1349 [2024-11-13 13:20:12,990 INFO L226 Difference]: Without dead ends: 1345 [2024-11-13 13:20:12,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:12,994 INFO L432 NwaCegarLoop]: 1098 mSDtfsCounter, 382 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:12,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 2648 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:20:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-13 13:20:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1260. [2024-11-13 13:20:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 844 states have (on average 1.8815165876777251) internal successors, (1588), 1255 states have internal predecessors, (1588), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1594 transitions. [2024-11-13 13:20:13,109 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1594 transitions. Word has length 4 [2024-11-13 13:20:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:13,110 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1594 transitions. [2024-11-13 13:20:13,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1594 transitions. [2024-11-13 13:20:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 13:20:13,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:13,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 13:20:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:20:13,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-13 13:20:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522667561] [2024-11-13 13:20:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:13,214 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:20:13,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522667561] [2024-11-13 13:20:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522667561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362218926] [2024-11-13 13:20:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:13,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:13,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:13,218 INFO L87 Difference]: Start difference. First operand 1260 states and 1594 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:13,861 INFO L93 Difference]: Finished difference Result 1257 states and 1586 transitions. [2024-11-13 13:20:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 13:20:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:13,866 INFO L225 Difference]: With dead ends: 1257 [2024-11-13 13:20:13,867 INFO L226 Difference]: Without dead ends: 1257 [2024-11-13 13:20:13,867 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:20:13,868 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1086 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:13,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 861 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:20:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-13 13:20:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-13 13:20:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 852 states have (on average 1.8544600938967135) internal successors, (1580), 1252 states have internal predecessors, (1580), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1586 transitions. [2024-11-13 13:20:13,900 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1586 transitions. Word has length 4 [2024-11-13 13:20:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:13,900 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1586 transitions. [2024-11-13 13:20:13,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1586 transitions. [2024-11-13 13:20:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 13:20:13,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:13,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 13:20:13,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:20:13,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-13 13:20:13,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:13,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612749278] [2024-11-13 13:20:13,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:13,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:14,038 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:20:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612749278] [2024-11-13 13:20:14,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612749278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:14,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859885253] [2024-11-13 13:20:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:14,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:14,039 INFO L87 Difference]: Start difference. First operand 1257 states and 1586 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:14,822 INFO L93 Difference]: Finished difference Result 1341 states and 1581 transitions. [2024-11-13 13:20:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 13:20:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:14,828 INFO L225 Difference]: With dead ends: 1341 [2024-11-13 13:20:14,828 INFO L226 Difference]: Without dead ends: 1341 [2024-11-13 13:20:14,828 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:20:14,829 INFO L432 NwaCegarLoop]: 1100 mSDtfsCounter, 380 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:14,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1874 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:20:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-13 13:20:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1256. [2024-11-13 13:20:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 852 states have (on average 1.846244131455399) internal successors, (1573), 1251 states have internal predecessors, (1573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1579 transitions. [2024-11-13 13:20:14,862 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1579 transitions. Word has length 4 [2024-11-13 13:20:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:14,863 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1579 transitions. [2024-11-13 13:20:14,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1579 transitions. [2024-11-13 13:20:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 13:20:14,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:14,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:14,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:20:14,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:14,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-13 13:20:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:14,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911747745] [2024-11-13 13:20:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:15,183 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:20:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:15,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911747745] [2024-11-13 13:20:15,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911747745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:15,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663477274] [2024-11-13 13:20:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:15,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:15,185 INFO L87 Difference]: Start difference. First operand 1256 states and 1579 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:20:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:16,564 INFO L93 Difference]: Finished difference Result 1330 states and 1569 transitions. [2024-11-13 13:20:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:16,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:20:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:16,570 INFO L225 Difference]: With dead ends: 1330 [2024-11-13 13:20:16,570 INFO L226 Difference]: Without dead ends: 1330 [2024-11-13 13:20:16,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:16,571 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 2174 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:16,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 1119 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 13:20:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-13 13:20:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1245. [2024-11-13 13:20:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 852 states have (on average 1.8321596244131455) internal successors, (1561), 1240 states have internal predecessors, (1561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1567 transitions. [2024-11-13 13:20:16,602 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1567 transitions. Word has length 8 [2024-11-13 13:20:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:16,603 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1567 transitions. [2024-11-13 13:20:16,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:20:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1567 transitions. [2024-11-13 13:20:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:20:16,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:16,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:16,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:20:16,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:16,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-13 13:20:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:16,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521968943] [2024-11-13 13:20:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:16,728 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:20:16,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521968943] [2024-11-13 13:20:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521968943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:16,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281229431] [2024-11-13 13:20:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:16,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:16,730 INFO L87 Difference]: Start difference. First operand 1245 states and 1567 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:20:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:17,476 INFO L93 Difference]: Finished difference Result 1283 states and 1522 transitions. [2024-11-13 13:20:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:17,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:20:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:17,481 INFO L225 Difference]: With dead ends: 1283 [2024-11-13 13:20:17,481 INFO L226 Difference]: Without dead ends: 1283 [2024-11-13 13:20:17,481 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:20:17,484 INFO L432 NwaCegarLoop]: 1111 mSDtfsCounter, 1060 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:17,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1407 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:20:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-13 13:20:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1198. [2024-11-13 13:20:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 852 states have (on average 1.7769953051643192) internal successors, (1514), 1193 states have internal predecessors, (1514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1520 transitions. [2024-11-13 13:20:17,513 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1520 transitions. Word has length 9 [2024-11-13 13:20:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:17,514 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1520 transitions. [2024-11-13 13:20:17,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:20:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1520 transitions. [2024-11-13 13:20:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:20:17,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:17,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:17,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:20:17,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:17,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-13 13:20:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:17,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417252951] [2024-11-13 13:20:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:17,643 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:20:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417252951] [2024-11-13 13:20:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417252951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:17,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740970397] [2024-11-13 13:20:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:17,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:17,644 INFO L87 Difference]: Start difference. First operand 1198 states and 1520 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:20:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:18,402 INFO L93 Difference]: Finished difference Result 1483 states and 1881 transitions. [2024-11-13 13:20:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:18,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:20:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:18,409 INFO L225 Difference]: With dead ends: 1483 [2024-11-13 13:20:18,409 INFO L226 Difference]: Without dead ends: 1483 [2024-11-13 13:20:18,409 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:20:18,411 INFO L432 NwaCegarLoop]: 1244 mSDtfsCounter, 852 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:18,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1658 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:20:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-13 13:20:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1173. [2024-11-13 13:20:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 852 states have (on average 1.7476525821596245) internal successors, (1489), 1168 states have internal predecessors, (1489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1495 transitions. [2024-11-13 13:20:18,446 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1495 transitions. Word has length 9 [2024-11-13 13:20:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1495 transitions. [2024-11-13 13:20:18,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:20:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1495 transitions. [2024-11-13 13:20:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 13:20:18,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:18,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:20:18,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2040141864, now seen corresponding path program 1 times [2024-11-13 13:20:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497729646] [2024-11-13 13:20:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:18,552 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:20:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497729646] [2024-11-13 13:20:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497729646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:18,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346453153] [2024-11-13 13:20:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:18,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:18,554 INFO L87 Difference]: Start difference. First operand 1173 states and 1495 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:19,296 INFO L93 Difference]: Finished difference Result 1248 states and 1601 transitions. [2024-11-13 13:20:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:19,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 13:20:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:19,301 INFO L225 Difference]: With dead ends: 1248 [2024-11-13 13:20:19,302 INFO L226 Difference]: Without dead ends: 1248 [2024-11-13 13:20:19,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:19,303 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 1286 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:19,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1398 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:20:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-11-13 13:20:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1150. [2024-11-13 13:20:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 852 states have (on average 1.693661971830986) internal successors, (1443), 1145 states have internal predecessors, (1443), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1449 transitions. [2024-11-13 13:20:19,332 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1449 transitions. Word has length 14 [2024-11-13 13:20:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:19,332 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1449 transitions. [2024-11-13 13:20:19,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1449 transitions. [2024-11-13 13:20:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 13:20:19,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:19,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:19,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:20:19,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:19,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2040141863, now seen corresponding path program 1 times [2024-11-13 13:20:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617873777] [2024-11-13 13:20:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:19,504 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:20:19,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:19,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617873777] [2024-11-13 13:20:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617873777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:19,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:19,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938183887] [2024-11-13 13:20:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:19,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:19,506 INFO L87 Difference]: Start difference. First operand 1150 states and 1449 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:20,437 INFO L93 Difference]: Finished difference Result 1182 states and 1413 transitions. [2024-11-13 13:20:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:20,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 13:20:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:20,442 INFO L225 Difference]: With dead ends: 1182 [2024-11-13 13:20:20,442 INFO L226 Difference]: Without dead ends: 1182 [2024-11-13 13:20:20,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:20,443 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 431 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:20,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 2433 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:20:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-13 13:20:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1086. [2024-11-13 13:20:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 788 states have (on average 1.6865482233502538) internal successors, (1329), 1081 states have internal predecessors, (1329), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1335 transitions. [2024-11-13 13:20:20,470 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1335 transitions. Word has length 14 [2024-11-13 13:20:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:20,470 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1335 transitions. [2024-11-13 13:20:20,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1335 transitions. [2024-11-13 13:20:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:20:20,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:20,477 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:20:20,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:20:20,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2071047692, now seen corresponding path program 1 times [2024-11-13 13:20:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919717554] [2024-11-13 13:20:20,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:20,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:20,565 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:20:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919717554] [2024-11-13 13:20:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919717554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627604958] [2024-11-13 13:20:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:20,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:20,567 INFO L87 Difference]: Start difference. First operand 1086 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:20,639 INFO L93 Difference]: Finished difference Result 1064 states and 1299 transitions. [2024-11-13 13:20:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:20:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:20,643 INFO L225 Difference]: With dead ends: 1064 [2024-11-13 13:20:20,643 INFO L226 Difference]: Without dead ends: 1064 [2024-11-13 13:20:20,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:20,645 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 143 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:20,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 2982 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:20:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-11-13 13:20:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1058. [2024-11-13 13:20:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 767 states have (on average 1.6779661016949152) internal successors, (1287), 1053 states have internal predecessors, (1287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1293 transitions. [2024-11-13 13:20:20,670 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1293 transitions. Word has length 16 [2024-11-13 13:20:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:20,670 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1293 transitions. [2024-11-13 13:20:20,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1293 transitions. [2024-11-13 13:20:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 13:20:20,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:20,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:20,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:20:20,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -179577158, now seen corresponding path program 1 times [2024-11-13 13:20:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057568675] [2024-11-13 13:20:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:20,774 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:20:20,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057568675] [2024-11-13 13:20:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057568675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:20,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:20,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104576862] [2024-11-13 13:20:20,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:20,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:20,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:20,777 INFO L87 Difference]: Start difference. First operand 1058 states and 1293 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:21,616 INFO L93 Difference]: Finished difference Result 1124 states and 1348 transitions. [2024-11-13 13:20:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:21,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 13:20:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:21,620 INFO L225 Difference]: With dead ends: 1124 [2024-11-13 13:20:21,620 INFO L226 Difference]: Without dead ends: 1124 [2024-11-13 13:20:21,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:21,620 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 1274 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:21,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1826 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:20:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-13 13:20:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1035. [2024-11-13 13:20:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 767 states have (on average 1.6479791395045633) internal successors, (1264), 1030 states have internal predecessors, (1264), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1270 transitions. [2024-11-13 13:20:21,639 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1270 transitions. Word has length 19 [2024-11-13 13:20:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:21,640 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1270 transitions. [2024-11-13 13:20:21,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1270 transitions. [2024-11-13 13:20:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 13:20:21,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:21,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:21,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:20:21,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:21,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash -179577157, now seen corresponding path program 1 times [2024-11-13 13:20:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:21,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548232963] [2024-11-13 13:20:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:21,735 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:20:21,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548232963] [2024-11-13 13:20:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548232963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:21,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:21,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:21,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793583368] [2024-11-13 13:20:21,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:21,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:21,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:21,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:21,737 INFO L87 Difference]: Start difference. First operand 1035 states and 1270 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:21,768 INFO L93 Difference]: Finished difference Result 960 states and 1167 transitions. [2024-11-13 13:20:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 13:20:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:21,772 INFO L225 Difference]: With dead ends: 960 [2024-11-13 13:20:21,772 INFO L226 Difference]: Without dead ends: 960 [2024-11-13 13:20:21,772 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:20:21,773 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 61 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:21,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1787 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:20:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-13 13:20:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-11-13 13:20:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 704 states have (on average 1.6491477272727273) internal successors, (1161), 955 states have internal predecessors, (1161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1167 transitions. [2024-11-13 13:20:21,791 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1167 transitions. Word has length 19 [2024-11-13 13:20:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:21,791 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1167 transitions. [2024-11-13 13:20:21,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1167 transitions. [2024-11-13 13:20:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 13:20:21,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:21,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:21,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:20:21,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr339REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:21,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1695091963, now seen corresponding path program 1 times [2024-11-13 13:20:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:21,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649854312] [2024-11-13 13:20:21,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:21,906 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:20:21,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:21,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649854312] [2024-11-13 13:20:21,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649854312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:21,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:21,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:21,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946498490] [2024-11-13 13:20:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:21,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:21,908 INFO L87 Difference]: Start difference. First operand 960 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:21,938 INFO L93 Difference]: Finished difference Result 879 states and 1057 transitions. [2024-11-13 13:20:21,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:21,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 13:20:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:21,941 INFO L225 Difference]: With dead ends: 879 [2024-11-13 13:20:21,941 INFO L226 Difference]: Without dead ends: 879 [2024-11-13 13:20:21,941 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:20:21,942 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 33 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:21,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1609 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:20:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-13 13:20:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2024-11-13 13:20:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 635 states have (on average 1.6551181102362205) internal successors, (1051), 874 states have internal predecessors, (1051), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1057 transitions. [2024-11-13 13:20:21,960 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1057 transitions. Word has length 19 [2024-11-13 13:20:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:21,960 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1057 transitions. [2024-11-13 13:20:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1057 transitions. [2024-11-13 13:20:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:20:21,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:21,977 INFO L215 NwaCegarLoop]: trace histogram [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:20:21,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:20:21,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:21,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash -774800042, now seen corresponding path program 1 times [2024-11-13 13:20:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:21,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601680195] [2024-11-13 13:20:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,063 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:20:22,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:22,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601680195] [2024-11-13 13:20:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601680195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:22,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169450707] [2024-11-13 13:20:22,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:22,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:22,065 INFO L87 Difference]: Start difference. First operand 879 states and 1057 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:22,134 INFO L93 Difference]: Finished difference Result 861 states and 1032 transitions. [2024-11-13 13:20:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-13 13:20:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:22,137 INFO L225 Difference]: With dead ends: 861 [2024-11-13 13:20:22,137 INFO L226 Difference]: Without dead ends: 861 [2024-11-13 13:20:22,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:22,139 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 41 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:22,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2318 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:20:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-13 13:20:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 858. [2024-11-13 13:20:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 621 states have (on average 1.6473429951690821) internal successors, (1023), 853 states have internal predecessors, (1023), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1029 transitions. [2024-11-13 13:20:22,160 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1029 transitions. Word has length 21 [2024-11-13 13:20:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:22,161 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1029 transitions. [2024-11-13 13:20:22,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1029 transitions. [2024-11-13 13:20:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 13:20:22,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:22,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:22,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:20:22,163 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash -523088604, now seen corresponding path program 1 times [2024-11-13 13:20:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966672435] [2024-11-13 13:20:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,422 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:20:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966672435] [2024-11-13 13:20:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966672435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:22,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787635799] [2024-11-13 13:20:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:22,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:22,424 INFO L87 Difference]: Start difference. First operand 858 states and 1029 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:20:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:23,247 INFO L93 Difference]: Finished difference Result 1180 states and 1424 transitions. [2024-11-13 13:20:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-13 13:20:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:23,251 INFO L225 Difference]: With dead ends: 1180 [2024-11-13 13:20:23,252 INFO L226 Difference]: Without dead ends: 1180 [2024-11-13 13:20:23,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:23,252 INFO L432 NwaCegarLoop]: 885 mSDtfsCounter, 647 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:23,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1893 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:20:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-13 13:20:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 854. [2024-11-13 13:20:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 621 states have (on average 1.640901771336554) internal successors, (1019), 849 states have internal predecessors, (1019), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1025 transitions. [2024-11-13 13:20:23,274 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1025 transitions. Word has length 35 [2024-11-13 13:20:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:23,274 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1025 transitions. [2024-11-13 13:20:23,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:20:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1025 transitions. [2024-11-13 13:20:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 13:20:23,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:23,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:20:23,275 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1953401108, now seen corresponding path program 1 times [2024-11-13 13:20:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822682561] [2024-11-13 13:20:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:23,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,456 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:20:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822682561] [2024-11-13 13:20:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822682561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:23,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479946492] [2024-11-13 13:20:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:23,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:23,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:23,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:23,460 INFO L87 Difference]: Start difference. First operand 854 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:20:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:23,518 INFO L93 Difference]: Finished difference Result 854 states and 1017 transitions. [2024-11-13 13:20:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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 62 [2024-11-13 13:20:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:23,521 INFO L225 Difference]: With dead ends: 854 [2024-11-13 13:20:23,521 INFO L226 Difference]: Without dead ends: 854 [2024-11-13 13:20:23,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:23,524 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 27 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:23,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2294 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:20:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-13 13:20:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2024-11-13 13:20:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 621 states have (on average 1.6280193236714975) internal successors, (1011), 849 states have internal predecessors, (1011), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1017 transitions. [2024-11-13 13:20:23,539 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1017 transitions. Word has length 62 [2024-11-13 13:20:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:23,539 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1017 transitions. [2024-11-13 13:20:23,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:20:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1017 transitions. [2024-11-13 13:20:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 13:20:23,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:23,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:23,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:20:23,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:23,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1535646678, now seen corresponding path program 1 times [2024-11-13 13:20:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312268100] [2024-11-13 13:20:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:23,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,689 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:20:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312268100] [2024-11-13 13:20:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312268100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:23,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:23,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:23,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835113783] [2024-11-13 13:20:23,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:23,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:23,692 INFO L87 Difference]: Start difference. First operand 854 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:20:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:23,745 INFO L93 Difference]: Finished difference Result 854 states and 1013 transitions. [2024-11-13 13:20:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-13 13:20:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:23,748 INFO L225 Difference]: With dead ends: 854 [2024-11-13 13:20:23,748 INFO L226 Difference]: Without dead ends: 854 [2024-11-13 13:20:23,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:23,750 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 21 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:23,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2288 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:20:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-13 13:20:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2024-11-13 13:20:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 621 states have (on average 1.6215780998389695) internal successors, (1007), 849 states have internal predecessors, (1007), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1013 transitions. [2024-11-13 13:20:23,764 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1013 transitions. Word has length 69 [2024-11-13 13:20:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:23,765 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1013 transitions. [2024-11-13 13:20:23,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:20:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1013 transitions. [2024-11-13 13:20:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 13:20:23,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:23,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:23,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:20:23,767 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:23,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1787180320, now seen corresponding path program 1 times [2024-11-13 13:20:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622133833] [2024-11-13 13:20:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,883 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:20:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622133833] [2024-11-13 13:20:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622133833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:23,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772909361] [2024-11-13 13:20:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:23,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:23,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:23,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:23,885 INFO L87 Difference]: Start difference. First operand 854 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:20:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:23,953 INFO L93 Difference]: Finished difference Result 1018 states and 1186 transitions. [2024-11-13 13:20:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:23,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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) Word has length 70 [2024-11-13 13:20:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:23,956 INFO L225 Difference]: With dead ends: 1018 [2024-11-13 13:20:23,956 INFO L226 Difference]: Without dead ends: 1018 [2024-11-13 13:20:23,957 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:20:23,957 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 198 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:23,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1536 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:20:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-13 13:20:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1008. [2024-11-13 13:20:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 775 states have (on average 1.5174193548387096) internal successors, (1176), 1003 states have internal predecessors, (1176), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1182 transitions. [2024-11-13 13:20:23,975 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1182 transitions. Word has length 70 [2024-11-13 13:20:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:23,976 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1182 transitions. [2024-11-13 13:20:23,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:20:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1182 transitions. [2024-11-13 13:20:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 13:20:23,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:23,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:23,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:20:23,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:23,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1807782790, now seen corresponding path program 1 times [2024-11-13 13:20:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:23,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068253714] [2024-11-13 13:20:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:24,508 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:20:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068253714] [2024-11-13 13:20:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068253714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:24,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:20:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292689253] [2024-11-13 13:20:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:24,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:20:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:24,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:20:24,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:20:24,510 INFO L87 Difference]: Start difference. First operand 1008 states and 1182 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:20:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:24,749 INFO L93 Difference]: Finished difference Result 1480 states and 1684 transitions. [2024-11-13 13:20:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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) Word has length 76 [2024-11-13 13:20:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:24,752 INFO L225 Difference]: With dead ends: 1480 [2024-11-13 13:20:24,753 INFO L226 Difference]: Without dead ends: 1477 [2024-11-13 13:20:24,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:20:24,753 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 727 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 4586 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:24,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 4586 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:20:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-11-13 13:20:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 909. [2024-11-13 13:20:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 676 states have (on average 1.5502958579881656) internal successors, (1048), 904 states have internal predecessors, (1048), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1054 transitions. [2024-11-13 13:20:24,771 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1054 transitions. Word has length 76 [2024-11-13 13:20:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:24,772 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1054 transitions. [2024-11-13 13:20:24,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:20:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1054 transitions. [2024-11-13 13:20:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 13:20:24,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:24,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:24,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:20:24,773 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1111266443, now seen corresponding path program 1 times [2024-11-13 13:20:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:24,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930062074] [2024-11-13 13:20:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:25,092 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:20:25,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:25,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930062074] [2024-11-13 13:20:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930062074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:25,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795659486] [2024-11-13 13:20:25,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:25,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:25,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:25,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:25,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:25,094 INFO L87 Difference]: Start difference. First operand 909 states and 1054 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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:20:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:25,754 INFO L93 Difference]: Finished difference Result 908 states and 1053 transitions. [2024-11-13 13:20:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:25,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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) Word has length 85 [2024-11-13 13:20:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:25,757 INFO L225 Difference]: With dead ends: 908 [2024-11-13 13:20:25,757 INFO L226 Difference]: Without dead ends: 908 [2024-11-13 13:20:25,757 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:20:25,758 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 2 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:25,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2283 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:20:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-13 13:20:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2024-11-13 13:20:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 676 states have (on average 1.5488165680473374) internal successors, (1047), 903 states have internal predecessors, (1047), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1053 transitions. [2024-11-13 13:20:25,778 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1053 transitions. Word has length 85 [2024-11-13 13:20:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:25,779 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1053 transitions. [2024-11-13 13:20:25,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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:20:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1053 transitions. [2024-11-13 13:20:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 13:20:25,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:25,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:25,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:20:25,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:25,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:25,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1111266442, now seen corresponding path program 1 times [2024-11-13 13:20:25,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:25,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6183771] [2024-11-13 13:20:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:25,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:26,380 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:20:26,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6183771] [2024-11-13 13:20:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6183771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:26,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:26,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579520601] [2024-11-13 13:20:26,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:26,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:26,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:26,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:26,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:26,383 INFO L87 Difference]: Start difference. First operand 908 states and 1053 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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:20:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:27,228 INFO L93 Difference]: Finished difference Result 907 states and 1052 transitions. [2024-11-13 13:20:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:27,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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) Word has length 85 [2024-11-13 13:20:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:27,231 INFO L225 Difference]: With dead ends: 907 [2024-11-13 13:20:27,232 INFO L226 Difference]: Without dead ends: 907 [2024-11-13 13:20:27,232 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:20:27,233 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:27,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2242 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:20:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-13 13:20:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2024-11-13 13:20:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 675 states have (on average 1.5496296296296297) internal successors, (1046), 902 states have internal predecessors, (1046), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1052 transitions. [2024-11-13 13:20:27,250 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1052 transitions. Word has length 85 [2024-11-13 13:20:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:27,250 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1052 transitions. [2024-11-13 13:20:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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:20:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1052 transitions. [2024-11-13 13:20:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 13:20:27,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:27,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:27,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:20:27,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1040849540, now seen corresponding path program 1 times [2024-11-13 13:20:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395117794] [2024-11-13 13:20:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:27,603 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:20:27,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395117794] [2024-11-13 13:20:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395117794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:27,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:27,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:20:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77135475] [2024-11-13 13:20:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:27,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:20:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:27,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:20:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:20:27,606 INFO L87 Difference]: Start difference. First operand 907 states and 1052 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:28,612 INFO L93 Difference]: Finished difference Result 919 states and 1067 transitions. [2024-11-13 13:20:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:20:28,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-13 13:20:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:28,619 INFO L225 Difference]: With dead ends: 919 [2024-11-13 13:20:28,619 INFO L226 Difference]: Without dead ends: 919 [2024-11-13 13:20:28,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:20:28,620 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 10 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:28,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3532 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:20:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-13 13:20:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 913. [2024-11-13 13:20:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 680 states have (on average 1.548529411764706) internal successors, (1053), 907 states have internal predecessors, (1053), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 13:20:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1062 transitions. [2024-11-13 13:20:28,641 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1062 transitions. Word has length 93 [2024-11-13 13:20:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:28,642 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1062 transitions. [2024-11-13 13:20:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1062 transitions. [2024-11-13 13:20:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 13:20:28,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:28,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:28,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:20:28,643 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1040849539, now seen corresponding path program 1 times [2024-11-13 13:20:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186141210] [2024-11-13 13:20:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:29,328 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:20:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186141210] [2024-11-13 13:20:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186141210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:29,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:29,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:20:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070521255] [2024-11-13 13:20:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:20:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:20:29,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:20:29,330 INFO L87 Difference]: Start difference. First operand 913 states and 1062 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:30,410 INFO L93 Difference]: Finished difference Result 913 states and 1061 transitions. [2024-11-13 13:20:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-13 13:20:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:30,413 INFO L225 Difference]: With dead ends: 913 [2024-11-13 13:20:30,414 INFO L226 Difference]: Without dead ends: 913 [2024-11-13 13:20:30,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:30,416 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 5 mSDsluCounter, 2753 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:30,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3533 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:20:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2024-11-13 13:20:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2024-11-13 13:20:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 680 states have (on average 1.5470588235294118) internal successors, (1052), 907 states have internal predecessors, (1052), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 13:20:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1061 transitions. [2024-11-13 13:20:30,434 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1061 transitions. Word has length 93 [2024-11-13 13:20:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:30,435 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1061 transitions. [2024-11-13 13:20:30,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1061 transitions. [2024-11-13 13:20:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:20:30,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:30,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:30,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:20:30,437 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:30,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1560344779, now seen corresponding path program 1 times [2024-11-13 13:20:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107674792] [2024-11-13 13:20:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:31,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:31,248 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:20:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107674792] [2024-11-13 13:20:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107674792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441911963] [2024-11-13 13:20:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:31,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:31,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:31,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:20:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:31,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 13:20:31,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:31,540 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:20:31,702 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:20:31,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:20:31,759 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:20:31,880 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 22 treesize of output 10 [2024-11-13 13:20:32,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:20:32,100 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:20:32,196 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:20:32,240 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:20:32,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:32,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_648 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 13:20:32,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441911963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:32,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:32,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-13 13:20:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118643957] [2024-11-13 13:20:32,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:32,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:20:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:32,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:20:32,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-13 13:20:32,289 INFO L87 Difference]: Start difference. First operand 913 states and 1061 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:20:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:35,337 INFO L93 Difference]: Finished difference Result 920 states and 1068 transitions. [2024-11-13 13:20:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:20:35,338 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-13 13:20:35,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:35,341 INFO L225 Difference]: With dead ends: 920 [2024-11-13 13:20:35,341 INFO L226 Difference]: Without dead ends: 920 [2024-11-13 13:20:35,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-13 13:20:35,342 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 696 mSDsluCounter, 5693 mSDsCounter, 0 mSdLazyCounter, 4014 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 6182 SdHoareTripleChecker+Invalid, 4028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:35,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 6182 Invalid, 4028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4014 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 13:20:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-13 13:20:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 917. [2024-11-13 13:20:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 684 states have (on average 1.543859649122807) internal successors, (1056), 910 states have internal predecessors, (1056), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:20:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1063 transitions. [2024-11-13 13:20:35,358 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1063 transitions. Word has length 94 [2024-11-13 13:20:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:35,359 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1063 transitions. [2024-11-13 13:20:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:20:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1063 transitions. [2024-11-13 13:20:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:20:35,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:35,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:35,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:35,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 13:20:35,561 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1560344778, now seen corresponding path program 1 times [2024-11-13 13:20:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195854899] [2024-11-13 13:20:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:36,551 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:20:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195854899] [2024-11-13 13:20:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195854899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473068155] [2024-11-13 13:20:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:36,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:36,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:36,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:36,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:20:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:36,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 13:20:36,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:36,817 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:20:36,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:20:36,968 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:20:36,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:20:37,023 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:20:37,029 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:20:37,158 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 22 treesize of output 10 [2024-11-13 13:20:37,164 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:20:37,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:20:37,306 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:20:37,317 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:20:37,366 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:20:37,373 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:20:37,398 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:20:37,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:37,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_798 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_798 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 13:20:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473068155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:37,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:37,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-13 13:20:37,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953577717] [2024-11-13 13:20:37,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:37,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:20:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:20:37,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-13 13:20:37,530 INFO L87 Difference]: Start difference. First operand 917 states and 1063 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:20:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:40,711 INFO L93 Difference]: Finished difference Result 919 states and 1067 transitions. [2024-11-13 13:20:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:20:40,711 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-13 13:20:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:40,721 INFO L225 Difference]: With dead ends: 919 [2024-11-13 13:20:40,721 INFO L226 Difference]: Without dead ends: 919 [2024-11-13 13:20:40,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-13 13:20:40,727 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 701 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 4484 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 4940 SdHoareTripleChecker+Invalid, 4503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:40,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 4940 Invalid, 4503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4484 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 13:20:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-13 13:20:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 910. [2024-11-13 13:20:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 679 states have (on average 1.544918998527246) internal successors, (1049), 904 states have internal predecessors, (1049), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1055 transitions. [2024-11-13 13:20:40,771 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1055 transitions. Word has length 94 [2024-11-13 13:20:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:40,771 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1055 transitions. [2024-11-13 13:20:40,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:20:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1055 transitions. [2024-11-13 13:20:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 13:20:40,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:40,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:40,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:40,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:20:40,973 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:40,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1715862564, now seen corresponding path program 1 times [2024-11-13 13:20:40,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:40,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473111286] [2024-11-13 13:20:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:41,853 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:20:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473111286] [2024-11-13 13:20:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473111286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:41,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:41,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 13:20:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644440581] [2024-11-13 13:20:41,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:41,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:20:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:20:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:20:41,855 INFO L87 Difference]: Start difference. First operand 910 states and 1055 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:43,746 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2024-11-13 13:20:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:20:43,746 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-13 13:20:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:43,750 INFO L225 Difference]: With dead ends: 923 [2024-11-13 13:20:43,750 INFO L226 Difference]: Without dead ends: 923 [2024-11-13 13:20:43,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:20:43,750 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 710 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:43,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 3513 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 13:20:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-13 13:20:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 919. [2024-11-13 13:20:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 687 states have (on average 1.5414847161572052) internal successors, (1059), 912 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:20:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1066 transitions. [2024-11-13 13:20:43,777 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1066 transitions. Word has length 96 [2024-11-13 13:20:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:43,777 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1066 transitions. [2024-11-13 13:20:43,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1066 transitions. [2024-11-13 13:20:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 13:20:43,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:43,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:43,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 13:20:43,783 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:43,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1715862563, now seen corresponding path program 1 times [2024-11-13 13:20:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231032272] [2024-11-13 13:20:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:44,502 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:20:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231032272] [2024-11-13 13:20:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231032272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:44,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:20:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730748143] [2024-11-13 13:20:44,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:20:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:20:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:20:44,505 INFO L87 Difference]: Start difference. First operand 919 states and 1066 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:46,609 INFO L93 Difference]: Finished difference Result 922 states and 1070 transitions. [2024-11-13 13:20:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:20:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-13 13:20:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:46,612 INFO L225 Difference]: With dead ends: 922 [2024-11-13 13:20:46,612 INFO L226 Difference]: Without dead ends: 922 [2024-11-13 13:20:46,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:20:46,613 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 706 mSDsluCounter, 5228 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 5718 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:46,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 5718 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3692 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 13:20:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-13 13:20:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2024-11-13 13:20:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 687 states have (on average 1.5400291120815137) internal successors, (1058), 912 states have internal predecessors, (1058), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:20:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1065 transitions. [2024-11-13 13:20:46,633 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1065 transitions. Word has length 96 [2024-11-13 13:20:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:46,637 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1065 transitions. [2024-11-13 13:20:46,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1065 transitions. [2024-11-13 13:20:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 13:20:46,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:46,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:46,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 13:20:46,642 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash 200365003, now seen corresponding path program 1 times [2024-11-13 13:20:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:46,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919263210] [2024-11-13 13:20:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:47,599 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:20:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919263210] [2024-11-13 13:20:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919263210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:47,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599433701] [2024-11-13 13:20:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:47,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:47,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:20:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:47,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 13:20:47,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:47,897 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:20:48,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:20:48,056 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:20:48,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:20:48,074 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:20:48,085 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:20:48,144 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 22 treesize of output 10 [2024-11-13 13:20:48,149 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:20:48,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:20:48,274 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:20:48,283 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:20:48,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:20:48,362 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:20:48,371 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:20:48,389 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:20:48,394 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:20:48,399 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:20:48,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:48,542 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1087) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1087 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1087) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-13 13:20:48,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1093) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1087) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1094))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1093) .cse1 v_ArrVal_1087) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 13:20:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599433701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:48,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-13 13:20:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758329658] [2024-11-13 13:20:48,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:48,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:20:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:20:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=8, NotChecked=74, Total=462 [2024-11-13 13:20:48,609 INFO L87 Difference]: Start difference. First operand 919 states and 1065 transitions. Second operand has 17 states, 15 states have (on average 9.733333333333333) internal successors, (146), 16 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:20:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:51,281 INFO L93 Difference]: Finished difference Result 921 states and 1069 transitions. [2024-11-13 13:20:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:20:51,281 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.733333333333333) internal successors, (146), 16 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-11-13 13:20:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:51,283 INFO L225 Difference]: With dead ends: 921 [2024-11-13 13:20:51,283 INFO L226 Difference]: Without dead ends: 921 [2024-11-13 13:20:51,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=540, Unknown=9, NotChecked=98, Total=756 [2024-11-13 13:20:51,284 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 696 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 3938 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 4629 SdHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:51,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 4629 Invalid, 3952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3938 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 13:20:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-13 13:20:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 918. [2024-11-13 13:20:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 687 states have (on average 1.5385735080058225) internal successors, (1057), 911 states have internal predecessors, (1057), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:20:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1064 transitions. [2024-11-13 13:20:51,296 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1064 transitions. Word has length 97 [2024-11-13 13:20:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:51,297 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1064 transitions. [2024-11-13 13:20:51,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.733333333333333) internal successors, (146), 16 states have internal predecessors, (146), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:20:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1064 transitions. [2024-11-13 13:20:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 13:20:51,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:51,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:51,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:20:51,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 13:20:51,503 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 200365002, now seen corresponding path program 1 times [2024-11-13 13:20:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:51,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934322579] [2024-11-13 13:20:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:52,175 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:20:52,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934322579] [2024-11-13 13:20:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934322579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316389807] [2024-11-13 13:20:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:52,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:52,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:52,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:52,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:20:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:52,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 13:20:52,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:52,458 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:20:52,604 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:20:52,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:20:52,645 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:20:52,742 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 22 treesize of output 10 [2024-11-13 13:20:52,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:20:52,918 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:20:53,030 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:20:53,031 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:20:53,048 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:20:53,091 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:20:53,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:53,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1252))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1249)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:20:53,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316389807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:53,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-13 13:20:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669026252] [2024-11-13 13:20:53,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:53,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:20:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:20:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=460, Unknown=16, NotChecked=44, Total=600 [2024-11-13 13:20:53,242 INFO L87 Difference]: Start difference. First operand 918 states and 1064 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:20:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:55,719 INFO L93 Difference]: Finished difference Result 920 states and 1068 transitions. [2024-11-13 13:20:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:20:55,719 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-13 13:20:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:55,722 INFO L225 Difference]: With dead ends: 920 [2024-11-13 13:20:55,722 INFO L226 Difference]: Without dead ends: 920 [2024-11-13 13:20:55,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=636, Unknown=16, NotChecked=52, Total=812 [2024-11-13 13:20:55,723 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 689 mSDsluCounter, 5684 mSDsCounter, 0 mSdLazyCounter, 3974 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 6172 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:55,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 6172 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3974 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 13:20:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-13 13:20:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 908. [2024-11-13 13:20:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 679 states have (on average 1.5419734904270987) internal successors, (1047), 902 states have internal predecessors, (1047), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:20:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1053 transitions. [2024-11-13 13:20:55,734 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1053 transitions. Word has length 97 [2024-11-13 13:20:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:55,735 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1053 transitions. [2024-11-13 13:20:55,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:20:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1053 transitions. [2024-11-13 13:20:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 13:20:55,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:55,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:55,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:20:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:20:55,940 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1438504125, now seen corresponding path program 1 times [2024-11-13 13:20:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506906697] [2024-11-13 13:20:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:56,615 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:20:56,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506906697] [2024-11-13 13:20:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506906697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:56,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:56,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 13:20:56,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436475290] [2024-11-13 13:20:56,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:56,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:20:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:56,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:20:56,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:20:56,617 INFO L87 Difference]: Start difference. First operand 908 states and 1053 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:58,395 INFO L93 Difference]: Finished difference Result 924 states and 1072 transitions. [2024-11-13 13:20:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:20:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-13 13:20:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:58,398 INFO L225 Difference]: With dead ends: 924 [2024-11-13 13:20:58,398 INFO L226 Difference]: Without dead ends: 924 [2024-11-13 13:20:58,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 13:20:58,399 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 715 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 4301 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:58,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 4301 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 13:20:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-13 13:20:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2024-11-13 13:20:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 690 states have (on average 1.536231884057971) internal successors, (1060), 913 states have internal predecessors, (1060), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:20:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1067 transitions. [2024-11-13 13:20:58,415 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1067 transitions. Word has length 99 [2024-11-13 13:20:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:58,416 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1067 transitions. [2024-11-13 13:20:58,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:20:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1067 transitions. [2024-11-13 13:20:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 13:20:58,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:58,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:58,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 13:20:58,417 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:20:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1438504124, now seen corresponding path program 1 times [2024-11-13 13:20:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:58,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597203378] [2024-11-13 13:20:58,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:20:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:59,351 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:20:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597203378] [2024-11-13 13:20:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597203378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 13:20:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685142080] [2024-11-13 13:20:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:59,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:20:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:20:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:20:59,353 INFO L87 Difference]: Start difference. First operand 920 states and 1067 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:02,078 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2024-11-13 13:21:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:21:02,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-13 13:21:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:02,081 INFO L225 Difference]: With dead ends: 923 [2024-11-13 13:21:02,081 INFO L226 Difference]: Without dead ends: 923 [2024-11-13 13:21:02,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:21:02,082 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 725 mSDsluCounter, 4139 mSDsCounter, 0 mSdLazyCounter, 3923 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 4631 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:02,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 4631 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3923 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 13:21:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-13 13:21:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-13 13:21:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 913 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1066 transitions. [2024-11-13 13:21:02,106 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1066 transitions. Word has length 99 [2024-11-13 13:21:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:02,107 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1066 transitions. [2024-11-13 13:21:02,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1066 transitions. [2024-11-13 13:21:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:21:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:02,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 13:21:02,108 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -930128324, now seen corresponding path program 1 times [2024-11-13 13:21:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325940046] [2024-11-13 13:21:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:02,837 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:21:02,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325940046] [2024-11-13 13:21:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325940046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977955289] [2024-11-13 13:21:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:02,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:02,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:02,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:02,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:21:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:03,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 13:21:03,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:03,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:21:03,299 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:21:03,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:21:03,330 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:21:03,461 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 22 treesize of output 10 [2024-11-13 13:21:03,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:03,715 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:21:03,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:03,837 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:21:03,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:03,929 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:21:03,949 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:21:03,997 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:21:03,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:04,009 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1564 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1564) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 13:21:04,017 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1564 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:21:04,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1563 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1563))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1564)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:21:04,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1563 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1564)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:21:04,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1563 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1567))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1563)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1564)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:21:04,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977955289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:04,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:04,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-13 13:21:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835733850] [2024-11-13 13:21:04,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:04,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 13:21:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:04,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 13:21:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=476, Unknown=5, NotChecked=240, Total=812 [2024-11-13 13:21:04,085 INFO L87 Difference]: Start difference. First operand 920 states and 1066 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:06,844 INFO L93 Difference]: Finished difference Result 922 states and 1070 transitions. [2024-11-13 13:21:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:21:06,845 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-13 13:21:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:06,847 INFO L225 Difference]: With dead ends: 922 [2024-11-13 13:21:06,847 INFO L226 Difference]: Without dead ends: 922 [2024-11-13 13:21:06,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=653, Unknown=5, NotChecked=280, Total=1056 [2024-11-13 13:21:06,847 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 686 mSDsluCounter, 6176 mSDsCounter, 0 mSdLazyCounter, 4292 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 6663 SdHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:06,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 6663 Invalid, 4307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4292 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 13:21:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-13 13:21:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2024-11-13 13:21:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 690 states have (on average 1.5333333333333334) internal successors, (1058), 912 states have internal predecessors, (1058), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1065 transitions. [2024-11-13 13:21:06,857 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1065 transitions. Word has length 100 [2024-11-13 13:21:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:06,858 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1065 transitions. [2024-11-13 13:21:06,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1065 transitions. [2024-11-13 13:21:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:21:06,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:06,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:06,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:21:07,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:07,059 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:07,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash -930128323, now seen corresponding path program 1 times [2024-11-13 13:21:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:07,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49353061] [2024-11-13 13:21:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:07,983 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:21:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49353061] [2024-11-13 13:21:07,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49353061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:07,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423935868] [2024-11-13 13:21:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:07,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:07,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:07,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:07,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:21:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:08,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 13:21:08,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:08,272 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:21:08,396 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:21:08,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:21:08,405 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:21:08,422 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:21:08,429 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:21:08,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 13:21:08,499 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:21:08,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:08,599 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:21:08,608 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:21:08,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:08,688 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:21:08,695 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:21:08,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:08,771 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:21:08,779 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:21:08,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 13:21:08,802 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:21:08,805 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:21:08,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:08,935 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1739 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:21:08,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1737))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1736) .cse0 v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1736) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 13:21:08,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1737))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1736) .cse1 v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1736) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-13 13:21:09,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1745))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1737))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1744) .cse0 v_ArrVal_1736) .cse1 v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1745))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1744) .cse5 v_ArrVal_1736) (select (select (store .cse6 .cse5 v_ArrVal_1737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1739))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-13 13:21:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423935868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:09,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2024-11-13 13:21:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274519369] [2024-11-13 13:21:09,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:21:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:21:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=426, Unknown=10, NotChecked=180, Total=702 [2024-11-13 13:21:09,060 INFO L87 Difference]: Start difference. First operand 919 states and 1065 transitions. Second operand has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 19 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:11,157 INFO L93 Difference]: Finished difference Result 921 states and 1069 transitions. [2024-11-13 13:21:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:21:11,158 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 19 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-13 13:21:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:11,159 INFO L225 Difference]: With dead ends: 921 [2024-11-13 13:21:11,159 INFO L226 Difference]: Without dead ends: 921 [2024-11-13 13:21:11,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=735, Unknown=11, NotChecked=236, Total=1122 [2024-11-13 13:21:11,160 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 695 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:11,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3521 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 13:21:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-13 13:21:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 906. [2024-11-13 13:21:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 679 states have (on average 1.5390279823269515) internal successors, (1045), 900 states have internal predecessors, (1045), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:21:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1051 transitions. [2024-11-13 13:21:11,176 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1051 transitions. Word has length 100 [2024-11-13 13:21:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:11,177 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1051 transitions. [2024-11-13 13:21:11,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 19 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1051 transitions. [2024-11-13 13:21:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 13:21:11,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:11,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:11,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:21:11,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:11,380 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:11,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash 707937098, now seen corresponding path program 1 times [2024-11-13 13:21:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330277002] [2024-11-13 13:21:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:12,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:12,217 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:21:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330277002] [2024-11-13 13:21:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330277002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:12,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:21:12,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:21:12,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908073849] [2024-11-13 13:21:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:12,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:21:12,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:12,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:21:12,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:21:12,220 INFO L87 Difference]: Start difference. First operand 906 states and 1051 transitions. Second operand has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:14,059 INFO L93 Difference]: Finished difference Result 925 states and 1073 transitions. [2024-11-13 13:21:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:21:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-13 13:21:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:14,062 INFO L225 Difference]: With dead ends: 925 [2024-11-13 13:21:14,062 INFO L226 Difference]: Without dead ends: 925 [2024-11-13 13:21:14,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:21:14,063 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 710 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 4775 SdHoareTripleChecker+Invalid, 3099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:14,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 4775 Invalid, 3099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3087 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 13:21:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-13 13:21:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2024-11-13 13:21:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 693 states have (on average 1.531024531024531) internal successors, (1061), 914 states have internal predecessors, (1061), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1068 transitions. [2024-11-13 13:21:14,072 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1068 transitions. Word has length 102 [2024-11-13 13:21:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:14,073 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1068 transitions. [2024-11-13 13:21:14,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1068 transitions. [2024-11-13 13:21:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 13:21:14,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:14,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:14,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 13:21:14,074 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:14,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash 707937099, now seen corresponding path program 1 times [2024-11-13 13:21:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:14,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617618653] [2024-11-13 13:21:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,120 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:21:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617618653] [2024-11-13 13:21:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617618653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:15,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:21:15,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:21:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314813756] [2024-11-13 13:21:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:15,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:21:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:21:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:21:15,123 INFO L87 Difference]: Start difference. First operand 921 states and 1068 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:17,340 INFO L93 Difference]: Finished difference Result 924 states and 1072 transitions. [2024-11-13 13:21:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:21:17,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-13 13:21:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:17,342 INFO L225 Difference]: With dead ends: 924 [2024-11-13 13:21:17,343 INFO L226 Difference]: Without dead ends: 924 [2024-11-13 13:21:17,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:21:17,343 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 726 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3814 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:17,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3814 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 13:21:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-13 13:21:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2024-11-13 13:21:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 693 states have (on average 1.5295815295815296) internal successors, (1060), 914 states have internal predecessors, (1060), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1067 transitions. [2024-11-13 13:21:17,354 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1067 transitions. Word has length 102 [2024-11-13 13:21:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:17,354 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1067 transitions. [2024-11-13 13:21:17,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1067 transitions. [2024-11-13 13:21:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:21:17,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:17,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:17,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 13:21:17,355 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1676738993, now seen corresponding path program 1 times [2024-11-13 13:21:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480030821] [2024-11-13 13:21:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:18,235 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:21:18,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:18,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480030821] [2024-11-13 13:21:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480030821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:18,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850192986] [2024-11-13 13:21:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:18,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:18,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:18,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:18,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:21:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:18,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:21:18,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:18,558 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:21:18,686 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:21:18,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:21:18,724 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:21:18,819 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 22 treesize of output 10 [2024-11-13 13:21:18,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:18,978 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:21:19,090 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:19,091 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:21:19,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:19,156 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:21:19,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:19,226 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:21:19,241 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:21:19,277 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:21:19,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:19,286 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2082 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2082) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 13:21:19,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2082 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:21:19,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2081 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:21:19,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2081 (Array Int Int)) (v_ArrVal_2080 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:21:19,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850192986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:19,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-13 13:21:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675816656] [2024-11-13 13:21:19,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:19,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 13:21:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 13:21:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=670, Unknown=39, NotChecked=228, Total=1056 [2024-11-13 13:21:19,611 INFO L87 Difference]: Start difference. First operand 921 states and 1067 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:23,270 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2024-11-13 13:21:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:21:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-13 13:21:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:23,273 INFO L225 Difference]: With dead ends: 923 [2024-11-13 13:21:23,273 INFO L226 Difference]: Without dead ends: 923 [2024-11-13 13:21:23,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=882, Unknown=43, NotChecked=260, Total=1332 [2024-11-13 13:21:23,274 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 679 mSDsluCounter, 8508 mSDsCounter, 0 mSdLazyCounter, 5744 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 8994 SdHoareTripleChecker+Invalid, 5757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:23,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 8994 Invalid, 5757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 5744 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-13 13:21:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-13 13:21:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-13 13:21:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 693 states have (on average 1.5281385281385282) internal successors, (1059), 913 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1066 transitions. [2024-11-13 13:21:23,283 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1066 transitions. Word has length 103 [2024-11-13 13:21:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:23,284 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1066 transitions. [2024-11-13 13:21:23,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1066 transitions. [2024-11-13 13:21:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:21:23,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:23,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:23,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:21:23,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 13:21:23,485 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:23,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1676738994, now seen corresponding path program 1 times [2024-11-13 13:21:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:23,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677070633] [2024-11-13 13:21:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:23,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:24,693 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:21:24,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:24,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677070633] [2024-11-13 13:21:24,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677070633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:24,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589449591] [2024-11-13 13:21:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:24,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:24,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:24,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:24,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:21:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:25,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 13:21:25,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:25,058 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:21:25,182 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:21:25,183 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:21:25,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:21:25,199 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:21:25,222 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:21:25,301 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 22 treesize of output 10 [2024-11-13 13:21:25,306 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:21:25,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:25,435 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:21:25,441 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:21:25,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:25,532 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:21:25,542 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:21:25,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:25,608 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:21:25,617 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:21:25,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:25,686 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:21:25,694 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:21:25,713 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:21:25,720 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:21:25,726 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:21:25,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:25,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2268))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2269) .cse0 v_ArrVal_2270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2269) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-13 13:21:25,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2268))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2269) .cse1 v_ArrVal_2270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2269) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-13 13:21:26,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2267))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2268))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2266) .cse0 v_ArrVal_2269) .cse1 v_ArrVal_2270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2267))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2266) .cse5 v_ArrVal_2269) (select (select (store .cse6 .cse5 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2270))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-13 13:21:26,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2276 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2277))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2267))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2276) .cse0 v_ArrVal_2266) .cse1 v_ArrVal_2269) (select (select (store .cse2 .cse1 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2270))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2277))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2267))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2268))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2276) .cse5 v_ArrVal_2266) .cse6 v_ArrVal_2269) .cse7 v_ArrVal_2270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-13 13:21:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589449591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:26,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2024-11-13 13:21:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096841914] [2024-11-13 13:21:26,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:26,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:21:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:21:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=569, Unknown=32, NotChecked=212, Total=930 [2024-11-13 13:21:26,554 INFO L87 Difference]: Start difference. First operand 920 states and 1066 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:30,043 INFO L93 Difference]: Finished difference Result 922 states and 1070 transitions. [2024-11-13 13:21:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:21:30,043 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-13 13:21:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:30,045 INFO L225 Difference]: With dead ends: 922 [2024-11-13 13:21:30,045 INFO L226 Difference]: Without dead ends: 922 [2024-11-13 13:21:30,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=980, Unknown=34, NotChecked=276, Total=1482 [2024-11-13 13:21:30,046 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 688 mSDsluCounter, 4041 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:30,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 4530 Invalid, 4083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 13:21:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-13 13:21:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 904. [2024-11-13 13:21:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 679 states have (on average 1.5360824742268042) internal successors, (1043), 898 states have internal predecessors, (1043), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:21:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1049 transitions. [2024-11-13 13:21:30,057 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1049 transitions. Word has length 103 [2024-11-13 13:21:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1049 transitions. [2024-11-13 13:21:30,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1049 transitions. [2024-11-13 13:21:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 13:21:30,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:30,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:30,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:21:30,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 13:21:30,259 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1990209228, now seen corresponding path program 1 times [2024-11-13 13:21:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906198305] [2024-11-13 13:21:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:31,073 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:21:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906198305] [2024-11-13 13:21:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906198305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:21:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:21:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87244178] [2024-11-13 13:21:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:31,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:21:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:21:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:21:31,074 INFO L87 Difference]: Start difference. First operand 904 states and 1049 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:32,831 INFO L93 Difference]: Finished difference Result 927 states and 1075 transitions. [2024-11-13 13:21:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:21:32,831 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-13 13:21:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:32,833 INFO L225 Difference]: With dead ends: 927 [2024-11-13 13:21:32,833 INFO L226 Difference]: Without dead ends: 927 [2024-11-13 13:21:32,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:21:32,838 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 731 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 2772 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:32,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4268 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2772 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 13:21:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-13 13:21:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 923. [2024-11-13 13:21:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 697 states have (on average 1.5251076040172167) internal successors, (1063), 916 states have internal predecessors, (1063), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1070 transitions. [2024-11-13 13:21:32,850 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1070 transitions. Word has length 106 [2024-11-13 13:21:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:32,851 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1070 transitions. [2024-11-13 13:21:32,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1070 transitions. [2024-11-13 13:21:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 13:21:32,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:32,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:32,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 13:21:32,852 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:32,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1990209229, now seen corresponding path program 1 times [2024-11-13 13:21:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493697865] [2024-11-13 13:21:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:33,998 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:21:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:33,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493697865] [2024-11-13 13:21:33,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493697865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:33,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:21:33,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:21:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267283625] [2024-11-13 13:21:33,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:33,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:21:33,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:33,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:21:33,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:21:33,999 INFO L87 Difference]: Start difference. First operand 923 states and 1070 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:36,782 INFO L93 Difference]: Finished difference Result 926 states and 1074 transitions. [2024-11-13 13:21:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:21:36,783 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-13 13:21:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:36,785 INFO L225 Difference]: With dead ends: 926 [2024-11-13 13:21:36,785 INFO L226 Difference]: Without dead ends: 926 [2024-11-13 13:21:36,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 13:21:36,786 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 731 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:36,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4608 Invalid, 3972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3954 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 13:21:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-13 13:21:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2024-11-13 13:21:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 697 states have (on average 1.5236728837876614) internal successors, (1062), 916 states have internal predecessors, (1062), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1069 transitions. [2024-11-13 13:21:36,793 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1069 transitions. Word has length 106 [2024-11-13 13:21:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:36,793 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1069 transitions. [2024-11-13 13:21:36,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:21:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1069 transitions. [2024-11-13 13:21:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:21:36,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:36,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:36,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 13:21:36,794 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:36,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash 477847987, now seen corresponding path program 1 times [2024-11-13 13:21:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:36,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646142155] [2024-11-13 13:21:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:37,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:37,555 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:21:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646142155] [2024-11-13 13:21:37,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646142155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679467185] [2024-11-13 13:21:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:37,557 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:37,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:21:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:37,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 13:21:37,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:37,891 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:21:38,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:21:38,029 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:21:38,060 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:21:38,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:38,167 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 31 treesize of output 32 [2024-11-13 13:21:38,206 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:38,206 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 31 treesize of output 32 [2024-11-13 13:21:38,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:38,257 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 31 treesize of output 32 [2024-11-13 13:21:38,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:38,306 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 31 treesize of output 32 [2024-11-13 13:21:38,350 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:38,350 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:21:38,361 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:21:38,382 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 13:21:38,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-13 13:21:38,385 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:21:38,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:38,518 INFO L349 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2024-11-13 13:21:38,518 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 57 treesize of output 74 [2024-11-13 13:21:38,533 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2646 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2646) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem59#1.base|)) is different from false [2024-11-13 13:21:38,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2645) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:21:38,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:21:38,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2644 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2644))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2645)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 13:21:41,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2643 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2643))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2644)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2645)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:21:41,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2643 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2643))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2644)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2645)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 13:21:41,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2643 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2650))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2643)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2644)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2645)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:21:41,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679467185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:41,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:41,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2024-11-13 13:21:41,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184907458] [2024-11-13 13:21:41,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:41,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 13:21:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:41,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 13:21:41,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=713, Unknown=8, NotChecked=420, Total=1260 [2024-11-13 13:21:41,755 INFO L87 Difference]: Start difference. First operand 923 states and 1069 transitions. Second operand has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 25 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:44,232 INFO L93 Difference]: Finished difference Result 925 states and 1073 transitions. [2024-11-13 13:21:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:21:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 25 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-13 13:21:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:44,234 INFO L225 Difference]: With dead ends: 925 [2024-11-13 13:21:44,235 INFO L226 Difference]: Without dead ends: 925 [2024-11-13 13:21:44,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=205, Invalid=1221, Unknown=8, NotChecked=546, Total=1980 [2024-11-13 13:21:44,235 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 690 mSDsluCounter, 5696 mSDsCounter, 0 mSdLazyCounter, 3977 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 6181 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:44,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 6181 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3977 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 13:21:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-13 13:21:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 922. [2024-11-13 13:21:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 697 states have (on average 1.5222381635581061) internal successors, (1061), 915 states have internal predecessors, (1061), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:21:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1068 transitions. [2024-11-13 13:21:44,245 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1068 transitions. Word has length 107 [2024-11-13 13:21:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:44,245 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1068 transitions. [2024-11-13 13:21:44,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 25 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:21:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1068 transitions. [2024-11-13 13:21:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:21:44,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:44,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:44,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:21:44,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-13 13:21:44,447 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:21:44,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash 477847988, now seen corresponding path program 1 times [2024-11-13 13:21:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480780737] [2024-11-13 13:21:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:21:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:46,197 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:21:46,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480780737] [2024-11-13 13:21:46,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480780737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073355207] [2024-11-13 13:21:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:46,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:46,200 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:46,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:21:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:46,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 13:21:46,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:46,581 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:21:46,711 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:21:46,731 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:21:46,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:21:46,785 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:21:46,791 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:21:46,924 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:21:46,929 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:21:47,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:47,174 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 73 treesize of output 66 [2024-11-13 13:21:47,189 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:21:47,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:47,351 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 73 treesize of output 66 [2024-11-13 13:21:47,361 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:21:47,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:47,462 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 73 treesize of output 66 [2024-11-13 13:21:47,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 30 treesize of output 13 [2024-11-13 13:21:47,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:47,576 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 73 treesize of output 66 [2024-11-13 13:21:47,581 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:21:47,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:21:47,697 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 73 treesize of output 66 [2024-11-13 13:21:47,702 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:21:47,736 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 18 [2024-11-13 13:21:47,743 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:21:47,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:47,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:21:47,832 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 13:21:47,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 13:21:47,871 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:21:47,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:48,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2852))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2851) .cse0 v_ArrVal_2853) (select (select (store .cse1 .cse0 v_ArrVal_2854) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2855))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2857 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2852))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2854))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2851) .cse3 v_ArrVal_2853) .cse4 v_ArrVal_2855) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2857) (select (select (store .cse5 .cse4 v_ArrVal_2856) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-13 13:22:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073355207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:22:10,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:22:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31 [2024-11-13 13:22:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664431590] [2024-11-13 13:22:10,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:22:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 13:22:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:10,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 13:22:10,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1539, Unknown=76, NotChecked=82, Total=1892 [2024-11-13 13:22:10,692 INFO L87 Difference]: Start difference. First operand 922 states and 1068 transitions. Second operand has 32 states, 29 states have (on average 7.068965517241379) internal successors, (205), 31 states have internal predecessors, (205), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:22:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:22:39,271 INFO L93 Difference]: Finished difference Result 924 states and 1072 transitions. [2024-11-13 13:22:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:22:39,272 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 7.068965517241379) internal successors, (205), 31 states have internal predecessors, (205), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-13 13:22:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:22:39,274 INFO L225 Difference]: With dead ends: 924 [2024-11-13 13:22:39,274 INFO L226 Difference]: Without dead ends: 924 [2024-11-13 13:22:39,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=344, Invalid=2443, Unknown=79, NotChecked=104, Total=2970 [2024-11-13 13:22:39,275 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 726 mSDsluCounter, 5196 mSDsCounter, 0 mSdLazyCounter, 5368 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 5678 SdHoareTripleChecker+Invalid, 5398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:22:39,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 5678 Invalid, 5398 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 5368 Invalid, 0 Unknown, 0 Unchecked, 26.0s Time] [2024-11-13 13:22:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-13 13:22:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 902. [2024-11-13 13:22:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 679 states have (on average 1.533136966126657) internal successors, (1041), 896 states have internal predecessors, (1041), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:22:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1047 transitions. [2024-11-13 13:22:39,287 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1047 transitions. Word has length 107 [2024-11-13 13:22:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:22:39,288 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1047 transitions. [2024-11-13 13:22:39,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 7.068965517241379) internal successors, (205), 31 states have internal predecessors, (205), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:22:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1047 transitions. [2024-11-13 13:22:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:22:39,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:22:39,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:22:39,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 13:22:39,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 13:22:39,490 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:22:39,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:22:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1699749552, now seen corresponding path program 1 times [2024-11-13 13:22:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:22:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258508530] [2024-11-13 13:22:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:22:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:22:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:22:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:22:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258508530] [2024-11-13 13:22:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258508530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:22:40,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:22:40,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:22:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599612114] [2024-11-13 13:22:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:22:40,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:22:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:22:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:22:40,535 INFO L87 Difference]: Start difference. First operand 902 states and 1047 transitions. Second operand has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:22:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:22:45,482 INFO L93 Difference]: Finished difference Result 907 states and 1055 transitions. [2024-11-13 13:22:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:22:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-13 13:22:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:22:45,485 INFO L225 Difference]: With dead ends: 907 [2024-11-13 13:22:45,485 INFO L226 Difference]: Without dead ends: 907 [2024-11-13 13:22:45,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:22:45,486 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 6 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:22:45,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3631 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-13 13:22:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-13 13:22:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 901. [2024-11-13 13:22:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 679 states have (on average 1.5316642120765833) internal successors, (1040), 895 states have internal predecessors, (1040), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:22:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1046 transitions. [2024-11-13 13:22:45,497 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1046 transitions. Word has length 109 [2024-11-13 13:22:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:22:45,497 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1046 transitions. [2024-11-13 13:22:45,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:22:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1046 transitions. [2024-11-13 13:22:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:22:45,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:22:45,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:22:45,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 13:22:45,499 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:22:45,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:22:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1699749551, now seen corresponding path program 1 times [2024-11-13 13:22:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:22:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833015002] [2024-11-13 13:22:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:22:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:22:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:49,103 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:22:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:22:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833015002] [2024-11-13 13:22:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833015002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:22:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:22:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:22:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332699796] [2024-11-13 13:22:49,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:22:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:22:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:22:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:22:49,106 INFO L87 Difference]: Start difference. First operand 901 states and 1046 transitions. Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:23:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:10,175 INFO L93 Difference]: Finished difference Result 926 states and 1074 transitions. [2024-11-13 13:23:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:23:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-13 13:23:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:10,178 INFO L225 Difference]: With dead ends: 926 [2024-11-13 13:23:10,178 INFO L226 Difference]: Without dead ends: 926 [2024-11-13 13:23:10,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:23:10,179 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 728 mSDsluCounter, 3970 mSDsCounter, 0 mSdLazyCounter, 4134 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 4459 SdHoareTripleChecker+Invalid, 4151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:10,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 4459 Invalid, 4151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4134 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2024-11-13 13:23:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-13 13:23:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2024-11-13 13:23:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 700 states have (on average 1.5171428571428571) internal successors, (1062), 916 states have internal predecessors, (1062), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:23:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1069 transitions. [2024-11-13 13:23:10,191 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1069 transitions. Word has length 109 [2024-11-13 13:23:10,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:10,192 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1069 transitions. [2024-11-13 13:23:10,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:23:10,192 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1069 transitions. [2024-11-13 13:23:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 13:23:10,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:10,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:23:10,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 13:23:10,193 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:23:10,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2048422154, now seen corresponding path program 1 times [2024-11-13 13:23:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:23:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711996941] [2024-11-13 13:23:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:23:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:13,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:23:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:14,072 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:23:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:23:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711996941] [2024-11-13 13:23:14,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711996941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:23:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650828401] [2024-11-13 13:23:14,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:14,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:14,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:23:14,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:23:14,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:23:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:14,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 13:23:14,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:23:14,456 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:23:15,134 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:23:15,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:23:15,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:23:15,485 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:23:15,534 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:23:16,179 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:23:16,191 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:23:17,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:23:17,068 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 73 treesize of output 66 [2024-11-13 13:23:17,082 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:23:17,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:23:17,716 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 73 treesize of output 66 [2024-11-13 13:23:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:23:18,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:23:18,326 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 73 treesize of output 66 [2024-11-13 13:23:18,357 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:23:18,797 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:23:18,797 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 73 treesize of output 66 [2024-11-13 13:23:18,809 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:23:19,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:23:19,279 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 73 treesize of output 66 [2024-11-13 13:23:19,295 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:23:19,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:23:19,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 13:23:19,951 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-13 13:23:19,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-13 13:23:20,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:23:20,104 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:23:20,134 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:23:20,193 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:23:20,204 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:23:20,220 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:23:20,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:23:20,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3267 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 13:23:21,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3264) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 40))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3265 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3263))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3264) .cse1 v_ArrVal_3267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3265) (select (select (store .cse2 .cse1 v_ArrVal_3266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-13 13:23:22,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3261 (Array Int Int)) (v_ArrVal_3262 (Array Int Int)) (v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3261))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3262) .cse1 v_ArrVal_3264) (select (select (store .cse2 .cse1 v_ArrVal_3263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3267))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3261 (Array Int Int)) (v_ArrVal_3262 (Array Int Int)) (v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (or (forall ((v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3265 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3261))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3263))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3262) .cse4 v_ArrVal_3264) .cse5 v_ArrVal_3267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3265) (select (select (store .cse6 .cse5 v_ArrVal_3266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-13 13:24:06,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3261 (Array Int Int)) (v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3262 (Array Int Int)) (v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3257 (Array Int Int)) (v_ArrVal_3258 (Array Int Int)) (v_ArrVal_3259 (Array Int Int)) (v_ArrVal_3260 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3273))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3257))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3259))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3261))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3272) .cse0 v_ArrVal_3258) .cse1 v_ArrVal_3260) .cse2 v_ArrVal_3262) .cse3 v_ArrVal_3264) (select (select (store .cse4 .cse3 v_ArrVal_3263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3267))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3261 (Array Int Int)) (v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3262 (Array Int Int)) (v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3257 (Array Int Int)) (v_ArrVal_3258 (Array Int Int)) (v_ArrVal_3259 (Array Int Int)) (v_ArrVal_3260 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3265 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3273))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_3257))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3259))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3261))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3263))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3272) .cse9 v_ArrVal_3258) .cse10 v_ArrVal_3260) .cse11 v_ArrVal_3262) .cse12 v_ArrVal_3264) .cse13 v_ArrVal_3267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3265) (select (select (store .cse14 .cse13 v_ArrVal_3266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))))) is different from false [2024-11-13 13:24:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650828401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:24:06,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:24:06,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 29 [2024-11-13 13:24:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115017373] [2024-11-13 13:24:06,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:24:06,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:24:06,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:24:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:24:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1291, Unknown=52, NotChecked=316, Total=1892 [2024-11-13 13:24:06,549 INFO L87 Difference]: Start difference. First operand 923 states and 1069 transitions. Second operand has 30 states, 27 states have (on average 6.62962962962963) internal successors, (179), 29 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:24:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:24:58,253 INFO L93 Difference]: Finished difference Result 925 states and 1073 transitions. [2024-11-13 13:24:58,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:24:58,254 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.62962962962963) internal successors, (179), 29 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-13 13:24:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:24:58,257 INFO L225 Difference]: With dead ends: 925 [2024-11-13 13:24:58,257 INFO L226 Difference]: Without dead ends: 925 [2024-11-13 13:24:58,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=265, Invalid=1591, Unknown=52, NotChecked=348, Total=2256 [2024-11-13 13:24:58,261 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 669 mSDsluCounter, 6106 mSDsCounter, 0 mSdLazyCounter, 5911 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 6590 SdHoareTripleChecker+Invalid, 5928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:24:58,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 6590 Invalid, 5928 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17 Valid, 5911 Invalid, 0 Unknown, 0 Unchecked, 50.3s Time] [2024-11-13 13:24:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-13 13:24:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 900. [2024-11-13 13:24:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 679 states have (on average 1.5301914580265095) internal successors, (1039), 894 states have internal predecessors, (1039), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:24:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1045 transitions. [2024-11-13 13:24:58,276 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1045 transitions. Word has length 110 [2024-11-13 13:24:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:24:58,279 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1045 transitions. [2024-11-13 13:24:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.62962962962963) internal successors, (179), 29 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:24:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1045 transitions. [2024-11-13 13:24:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 13:24:58,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:24:58,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:24:58,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 13:24:58,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-13 13:24:58,481 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:24:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:24:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash 426183539, now seen corresponding path program 1 times [2024-11-13 13:24:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:24:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076000337] [2024-11-13 13:24:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:24:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:24:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:25:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:02,338 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:25:02,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:25:02,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076000337] [2024-11-13 13:25:02,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076000337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:25:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:25:02,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:25:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588201167] [2024-11-13 13:25:02,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:25:02,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:25:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:25:02,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:25:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:25:02,340 INFO L87 Difference]: Start difference. First operand 900 states and 1045 transitions. Second operand has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:25:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:25:42,564 INFO L93 Difference]: Finished difference Result 951 states and 1101 transitions. [2024-11-13 13:25:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:25:42,565 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-13 13:25:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:25:42,567 INFO L225 Difference]: With dead ends: 951 [2024-11-13 13:25:42,567 INFO L226 Difference]: Without dead ends: 951 [2024-11-13 13:25:42,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:25:42,569 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 767 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 4342 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 6750 SdHoareTripleChecker+Invalid, 4361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:25:42,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 6750 Invalid, 4361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4342 Invalid, 0 Unknown, 0 Unchecked, 38.4s Time] [2024-11-13 13:25:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-13 13:25:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 925. [2024-11-13 13:25:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 703 states have (on average 1.5149359886201992) internal successors, (1065), 918 states have internal predecessors, (1065), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:25:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1072 transitions. [2024-11-13 13:25:42,593 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1072 transitions. Word has length 112 [2024-11-13 13:25:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:25:42,593 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1072 transitions. [2024-11-13 13:25:42,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:25:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1072 transitions. [2024-11-13 13:25:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 13:25:42,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:25:42,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:25:42,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 13:25:42,594 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:25:42,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:25:42,595 INFO L85 PathProgramCache]: Analyzing trace with hash 426183540, now seen corresponding path program 1 times [2024-11-13 13:25:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:25:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11448961] [2024-11-13 13:25:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:25:42,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:25:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:25:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:46,654 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:25:46,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:25:46,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11448961] [2024-11-13 13:25:46,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11448961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:25:46,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:25:46,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:25:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628077225] [2024-11-13 13:25:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:25:46,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:25:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:25:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:25:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:25:46,656 INFO L87 Difference]: Start difference. First operand 925 states and 1072 transitions. Second operand has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:26:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:26:23,425 INFO L93 Difference]: Finished difference Result 950 states and 1100 transitions. [2024-11-13 13:26:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:26:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-13 13:26:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:26:23,428 INFO L225 Difference]: With dead ends: 950 [2024-11-13 13:26:23,428 INFO L226 Difference]: Without dead ends: 950 [2024-11-13 13:26:23,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:26:23,429 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 792 mSDsluCounter, 5029 mSDsCounter, 0 mSdLazyCounter, 3905 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 5511 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:26:23,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 5511 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3905 Invalid, 0 Unknown, 0 Unchecked, 34.8s Time] [2024-11-13 13:26:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-13 13:26:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 925. [2024-11-13 13:26:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 703 states have (on average 1.5135135135135136) internal successors, (1064), 918 states have internal predecessors, (1064), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:26:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1071 transitions. [2024-11-13 13:26:23,443 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1071 transitions. Word has length 112 [2024-11-13 13:26:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:26:23,444 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1071 transitions. [2024-11-13 13:26:23,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:26:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1071 transitions. [2024-11-13 13:26:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 13:26:23,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:26:23,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:26:23,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 13:26:23,445 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:26:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:26:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1649685786, now seen corresponding path program 1 times [2024-11-13 13:26:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:26:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442183064] [2024-11-13 13:26:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:26:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:26:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:26:27,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:26:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:26:27,782 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:26:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:26:27,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442183064] [2024-11-13 13:26:27,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442183064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:26:27,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276809886] [2024-11-13 13:26:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:26:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:26:27,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:26:27,785 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:26:27,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:26:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:26:28,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:26:28,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:26:28,200 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:26:29,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:26:29,661 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:26:29,732 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:26:30,141 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:26:30,141 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 31 treesize of output 32 [2024-11-13 13:26:30,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:26:30,641 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 31 treesize of output 32 [2024-11-13 13:26:31,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:26:31,150 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 31 treesize of output 32 [2024-11-13 13:26:31,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:26:31,661 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 31 treesize of output 32 [2024-11-13 13:26:32,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:26:32,192 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 31 treesize of output 32 [2024-11-13 13:26:32,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:26:32,596 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:26:33,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:26:33,193 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:26:33,280 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:26:33,298 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:26:33,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:26:33,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3692 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:26:33,961 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 13:26:33,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-13 13:26:33,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3691 (Array Int Int)) (v_ArrVal_3692 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem60#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3691))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3692)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 13:26:34,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3690 (Array Int Int)) (v_ArrVal_3691 (Array Int Int)) (v_ArrVal_3692 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3690)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3691))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3692)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-13 13:26:34,861 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3690 (Array Int Int)) (v_ArrVal_3691 (Array Int Int)) (v_ArrVal_3692 (Array Int Int)) (v_ArrVal_3689 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3689))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3690)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3691))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3692)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 13:26:35,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3690 (Array Int Int)) (v_ArrVal_3691 (Array Int Int)) (v_ArrVal_3692 (Array Int Int)) (v_ArrVal_3688 (Array Int Int)) (v_ArrVal_3689 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3688))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3689)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3690)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3691))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3692)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:26:35,475 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3690 (Array Int Int)) (v_ArrVal_3691 (Array Int Int)) (v_ArrVal_3692 (Array Int Int)) (v_ArrVal_3688 (Array Int Int)) (v_ArrVal_3689 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3688))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3689)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3690)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3691))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3692)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 13:26:35,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3690 (Array Int Int)) (v_ArrVal_3691 (Array Int Int)) (v_ArrVal_3692 (Array Int Int)) (v_ArrVal_3687 (Array Int Int)) (v_ArrVal_3688 (Array Int Int)) (v_ArrVal_3689 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3687))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3688)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3689)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3690)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3691))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3692)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 13:26:36,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3690 (Array Int Int)) (v_ArrVal_3691 (Array Int Int)) (v_ArrVal_3692 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3687 (Array Int Int)) (v_ArrVal_3688 (Array Int Int)) (v_ArrVal_3689 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3695))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3687)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3688)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3689)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3690)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3691))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3692)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:26:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276809886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:26:36,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:26:36,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 24 [2024-11-13 13:26:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285988269] [2024-11-13 13:26:36,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:26:36,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:26:36,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:26:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:26:36,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=704, Unknown=45, NotChecked=504, Total=1406 [2024-11-13 13:26:36,842 INFO L87 Difference]: Start difference. First operand 925 states and 1071 transitions. Second operand has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:27:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:04,901 INFO L93 Difference]: Finished difference Result 941 states and 1089 transitions. [2024-11-13 13:27:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:27:04,901 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-13 13:27:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:04,904 INFO L225 Difference]: With dead ends: 941 [2024-11-13 13:27:04,904 INFO L226 Difference]: Without dead ends: 941 [2024-11-13 13:27:04,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=280, Invalid=1344, Unknown=48, NotChecked=680, Total=2352 [2024-11-13 13:27:04,906 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 723 mSDsluCounter, 3893 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:04,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 4379 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2882 Invalid, 0 Unknown, 0 Unchecked, 25.7s Time] [2024-11-13 13:27:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-13 13:27:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 924. [2024-11-13 13:27:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 703 states have (on average 1.5120910384068278) internal successors, (1063), 917 states have internal predecessors, (1063), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:27:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1070 transitions. [2024-11-13 13:27:04,919 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1070 transitions. Word has length 113 [2024-11-13 13:27:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:04,919 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1070 transitions. [2024-11-13 13:27:04,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:27:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1070 transitions. [2024-11-13 13:27:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 13:27:04,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:04,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:04,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:27:05,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:27:05,121 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:27:05,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:05,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1649685787, now seen corresponding path program 1 times [2024-11-13 13:27:05,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:05,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083382100] [2024-11-13 13:27:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:10,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:27:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:10,679 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:27:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083382100] [2024-11-13 13:27:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083382100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:27:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574917160] [2024-11-13 13:27:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:10,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:27:10,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:27:10,682 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:27:10,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:27:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:11,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 13:27:11,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:27:11,112 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:27:12,561 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:27:12,561 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:27:12,828 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:27:14,112 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:27:14,112 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 31 treesize of output 32 [2024-11-13 13:27:14,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:27:14,619 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 31 treesize of output 32 [2024-11-13 13:27:15,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:27:15,144 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 31 treesize of output 32 [2024-11-13 13:27:15,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:27:15,693 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 51 treesize of output 48 [2024-11-13 13:27:15,732 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 20 treesize of output 1 [2024-11-13 13:27:16,282 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:27:16,282 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 51 treesize of output 48 [2024-11-13 13:27:16,320 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 20 treesize of output 1 [2024-11-13 13:27:17,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:27:17,009 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 70 treesize of output 65 [2024-11-13 13:27:17,050 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 49 treesize of output 30 [2024-11-13 13:27:18,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:27:18,292 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 70 treesize of output 65 [2024-11-13 13:27:18,314 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 49 treesize of output 30 [2024-11-13 13:27:18,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-13 13:27:18,479 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 32 treesize of output 14 [2024-11-13 13:27:18,908 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:27:18,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:27:20,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3921 (Array Int Int)) (v_ArrVal_3922 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3922 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 13:27:20,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:27:20,430 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 82 treesize of output 86 [2024-11-13 13:27:22,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3917 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3918))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= .cse1 (select (select (let ((.cse2 (store .cse3 .cse1 v_prenex_39))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3921)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (forall ((v_ArrVal_3917 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3917))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (forall ((v_ArrVal_3918 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3918))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (store (store .cse4 .cse5 v_prenex_40) (select (select (store .cse6 .cse5 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ .cse7 1))) (< .cse7 0))))) (forall ((v_ArrVal_3917 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3917))) (or (forall ((v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3919 (Array Int Int)) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3922 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3918))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (store (store .cse8 .cse9 v_ArrVal_3920) (select (select (store .cse10 .cse9 v_ArrVal_3919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3922))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (< (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 0)))))) is different from false [2024-11-13 13:27:23,402 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 408243 treesize of output 394407 [2024-11-13 13:27:23,525 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 888 treesize of output 856 [2024-11-13 13:27:23,563 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 856 treesize of output 840 [2024-11-13 13:27:23,603 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 453 treesize of output 437 [2024-11-13 13:27:23,643 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 467 treesize of output 435 [2024-11-13 13:27:24,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:27:24,263 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:27:24,296 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 80803 treesize of output 80023 [2024-11-13 13:27:24,362 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 385 treesize of output 377 [2024-11-13 13:27:24,397 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 692 treesize of output 660 [2024-11-13 13:27:24,434 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 368 treesize of output 352 [2024-11-13 13:27:24,473 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 333 treesize of output 317 [2024-11-13 13:27:24,967 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3915 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3915))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_ArrVal_3918 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_3918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| .cse1)))))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int))) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3915))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3918)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3915))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3918)))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse4 (select (select (let ((.cse5 (store .cse6 .cse4 v_prenex_39))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3921)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3919 (Array Int Int))) (not (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3915))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3918)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3919)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3915))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_ArrVal_3918 (Array Int Int)) (v_prenex_39 (Array Int Int))) (not (= (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3918))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| .cse12)))))))) is different from false [2024-11-13 13:27:25,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3919 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3915))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3919)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3915))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= .cse4 |c_ULTIMATE.start_main_~user~0#1.base|)) (forall ((v_ArrVal_3918 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (store .cse5 .cse4 v_ArrVal_3918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_3915 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3915))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_3918 (Array Int Int)) (v_prenex_39 (Array Int Int))) (not (= (select (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_3918))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_39)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (not (= .cse8 |c_ULTIMATE.start_main_~user~0#1.base|)))))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (let ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3915))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3915))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_prenex_39))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3921)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse12))))))) is different from false [2024-11-13 13:27:25,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3914))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3915)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3918)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_39))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3921)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3919 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3914))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3915)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3918)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3919)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3914))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3915)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3918)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3914))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3915)))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (not (= .cse11 |c_ULTIMATE.start_main_~user~0#1.base|)) (forall ((v_ArrVal_3918 (Array Int Int)) (v_prenex_39 (Array Int Int))) (not (= (select (select (let ((.cse12 (store .cse13 .cse11 v_ArrVal_3918))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))))))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (let ((.cse15 (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3914))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3915)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_ArrVal_3918 (Array Int Int))) (not (= (select (select (store .cse15 .cse16 v_ArrVal_3918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (not (= .cse16 |c_ULTIMATE.start_main_~user~0#1.base|)))))))) is different from false [2024-11-13 13:27:27,226 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3913))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (let ((.cse5 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3913))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse4 (store .cse5 .cse6 v_prenex_39))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3921)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse6)))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= (select (select (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3913))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_39)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3919 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3913))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3919)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))))) is different from false [2024-11-13 13:27:29,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3919 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3925 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3925))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3913)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3919)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3925 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3925))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3913)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_prenex_39))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3921)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse8)))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3925 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3925))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3913)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_39)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3918 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3925 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (let ((.cse18 (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3925))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3913)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3914)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3915)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3918)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 13:27:29,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574917160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:27:29,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:27:29,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-13 13:27:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507546795] [2024-11-13 13:27:29,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:27:29,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 13:27:29,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:29,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 13:27:29,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1270, Unknown=40, NotChecked=560, Total=2070 [2024-11-13 13:27:29,541 INFO L87 Difference]: Start difference. First operand 924 states and 1070 transitions. Second operand has 32 states, 29 states have (on average 6.413793103448276) internal successors, (186), 31 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:28:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:42,002 INFO L93 Difference]: Finished difference Result 940 states and 1088 transitions. [2024-11-13 13:28:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:28:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.413793103448276) internal successors, (186), 31 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-13 13:28:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:42,005 INFO L225 Difference]: With dead ends: 940 [2024-11-13 13:28:42,006 INFO L226 Difference]: Without dead ends: 940 [2024-11-13 13:28:42,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=358, Invalid=2179, Unknown=41, NotChecked=728, Total=3306 [2024-11-13 13:28:42,007 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 766 mSDsluCounter, 9656 mSDsCounter, 0 mSdLazyCounter, 7005 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 10137 SdHoareTripleChecker+Invalid, 7032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:42,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 10137 Invalid, 7032 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 7005 Invalid, 0 Unknown, 0 Unchecked, 67.8s Time] [2024-11-13 13:28:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-13 13:28:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 898. [2024-11-13 13:28:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 679 states have (on average 1.5272459499263622) internal successors, (1037), 892 states have internal predecessors, (1037), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:28:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1043 transitions. [2024-11-13 13:28:42,021 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1043 transitions. Word has length 113 [2024-11-13 13:28:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:42,021 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1043 transitions. [2024-11-13 13:28:42,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.413793103448276) internal successors, (186), 31 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:28:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1043 transitions. [2024-11-13 13:28:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 13:28:42,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:42,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:42,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:28:42,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:28:42,224 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:28:42,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 511170564, now seen corresponding path program 1 times [2024-11-13 13:28:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442383617] [2024-11-13 13:28:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:28:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,812 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:28:42,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:42,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442383617] [2024-11-13 13:28:42,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442383617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:42,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:42,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:28:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685577035] [2024-11-13 13:28:42,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:42,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:28:42,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:42,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:28:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:28:42,814 INFO L87 Difference]: Start difference. First operand 898 states and 1043 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:28:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:51,590 INFO L93 Difference]: Finished difference Result 917 states and 1065 transitions. [2024-11-13 13:28:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:28:51,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-13 13:28:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:51,592 INFO L225 Difference]: With dead ends: 917 [2024-11-13 13:28:51,592 INFO L226 Difference]: Without dead ends: 917 [2024-11-13 13:28:51,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:28:51,593 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 22 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:51,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2960 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-13 13:28:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-13 13:28:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 897. [2024-11-13 13:28:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 679 states have (on average 1.5257731958762886) internal successors, (1036), 891 states have internal predecessors, (1036), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:28:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1042 transitions. [2024-11-13 13:28:51,601 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1042 transitions. Word has length 115 [2024-11-13 13:28:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:51,601 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1042 transitions. [2024-11-13 13:28:51,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:28:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1042 transitions. [2024-11-13 13:28:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 13:28:51,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:51,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:51,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-13 13:28:51,602 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:28:51,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash 511170565, now seen corresponding path program 1 times [2024-11-13 13:28:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201594684] [2024-11-13 13:28:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:28:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:56,245 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:28:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201594684] [2024-11-13 13:28:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201594684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:56,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:56,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 13:28:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548615827] [2024-11-13 13:28:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:56,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:28:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:28:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:28:56,247 INFO L87 Difference]: Start difference. First operand 897 states and 1042 transitions. Second operand has 19 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:29:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:40,624 INFO L93 Difference]: Finished difference Result 945 states and 1095 transitions. [2024-11-13 13:29:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:29:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-13 13:29:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:40,626 INFO L225 Difference]: With dead ends: 945 [2024-11-13 13:29:40,626 INFO L226 Difference]: Without dead ends: 945 [2024-11-13 13:29:40,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-13 13:29:40,627 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 767 mSDsluCounter, 5560 mSDsCounter, 0 mSdLazyCounter, 4242 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 6050 SdHoareTripleChecker+Invalid, 4258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:40,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 6050 Invalid, 4258 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 4242 Invalid, 0 Unknown, 0 Unchecked, 41.8s Time] [2024-11-13 13:29:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-13 13:29:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 925. [2024-11-13 13:29:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 706 states have (on average 1.5070821529745042) internal successors, (1064), 918 states have internal predecessors, (1064), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:29:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1071 transitions. [2024-11-13 13:29:40,644 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1071 transitions. Word has length 115 [2024-11-13 13:29:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:40,645 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1071 transitions. [2024-11-13 13:29:40,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:29:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1071 transitions. [2024-11-13 13:29:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 13:29:40,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:40,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:40,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-13 13:29:40,647 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:29:40,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:40,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1520830210, now seen corresponding path program 1 times [2024-11-13 13:29:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:40,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468283200] [2024-11-13 13:29:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:29:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:29:41,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:41,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468283200] [2024-11-13 13:29:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468283200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:29:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592742016] [2024-11-13 13:29:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:41,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:29:41,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:41,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:29:41,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:29:41,539 INFO L87 Difference]: Start difference. First operand 925 states and 1071 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:29:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:50,897 INFO L93 Difference]: Finished difference Result 941 states and 1089 transitions. [2024-11-13 13:29:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:29:50,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-13 13:29:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:50,900 INFO L225 Difference]: With dead ends: 941 [2024-11-13 13:29:50,900 INFO L226 Difference]: Without dead ends: 941 [2024-11-13 13:29:50,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:29:50,901 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 21 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:50,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2940 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-11-13 13:29:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-13 13:29:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 896. [2024-11-13 13:29:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 679 states have (on average 1.524300441826215) internal successors, (1035), 890 states have internal predecessors, (1035), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:29:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1041 transitions. [2024-11-13 13:29:50,916 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1041 transitions. Word has length 116 [2024-11-13 13:29:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1041 transitions. [2024-11-13 13:29:50,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:29:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1041 transitions. [2024-11-13 13:29:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 13:29:50,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:50,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:50,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-13 13:29:50,919 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:29:50,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1333581001, now seen corresponding path program 1 times [2024-11-13 13:29:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345896323] [2024-11-13 13:29:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:29:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:56,376 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:29:56,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:56,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345896323] [2024-11-13 13:29:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345896323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:56,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:56,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 13:29:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386146697] [2024-11-13 13:29:56,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:56,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:29:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:56,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:29:56,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:29:56,379 INFO L87 Difference]: Start difference. First operand 896 states and 1041 transitions. Second operand has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:30:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:23,474 INFO L93 Difference]: Finished difference Result 944 states and 1094 transitions. [2024-11-13 13:30:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:30:23,475 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-13 13:30:23,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:23,477 INFO L225 Difference]: With dead ends: 944 [2024-11-13 13:30:23,477 INFO L226 Difference]: Without dead ends: 944 [2024-11-13 13:30:23,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 13:30:23,478 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 784 mSDsluCounter, 3419 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:23,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 3911 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 24.3s Time] [2024-11-13 13:30:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-13 13:30:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 925. [2024-11-13 13:30:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 707 states have (on average 1.504950495049505) internal successors, (1064), 918 states have internal predecessors, (1064), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 13:30:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1073 transitions. [2024-11-13 13:30:23,492 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1073 transitions. Word has length 116 [2024-11-13 13:30:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:23,492 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1073 transitions. [2024-11-13 13:30:23,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:30:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1073 transitions. [2024-11-13 13:30:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 13:30:23,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:23,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:23,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-13 13:30:23,494 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:30:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1333581000, now seen corresponding path program 1 times [2024-11-13 13:30:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554314107] [2024-11-13 13:30:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:30:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:29,714 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:30:29,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:29,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554314107] [2024-11-13 13:30:29,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554314107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:29,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:29,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 13:30:29,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042003920] [2024-11-13 13:30:29,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:29,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:30:29,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:29,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:30:29,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:30:29,716 INFO L87 Difference]: Start difference. First operand 925 states and 1073 transitions. Second operand has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:31:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:06,197 INFO L93 Difference]: Finished difference Result 943 states and 1093 transitions. [2024-11-13 13:31:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:31:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-13 13:31:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:06,200 INFO L225 Difference]: With dead ends: 943 [2024-11-13 13:31:06,200 INFO L226 Difference]: Without dead ends: 943 [2024-11-13 13:31:06,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 13:31:06,200 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 762 mSDsluCounter, 4040 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:06,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 4530 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 33.2s Time] [2024-11-13 13:31:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-13 13:31:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 925. [2024-11-13 13:31:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 706 states have (on average 1.5056657223796035) internal successors, (1063), 918 states have internal predecessors, (1063), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 13:31:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1072 transitions. [2024-11-13 13:31:06,216 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1072 transitions. Word has length 116 [2024-11-13 13:31:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:06,217 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1072 transitions. [2024-11-13 13:31:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:31:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1072 transitions. [2024-11-13 13:31:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 13:31:06,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:06,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:06,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-13 13:31:06,218 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:31:06,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 98904414, now seen corresponding path program 1 times [2024-11-13 13:31:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560854824] [2024-11-13 13:31:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:31:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:11,550 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:31:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560854824] [2024-11-13 13:31:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560854824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043616832] [2024-11-13 13:31:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:11,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:11,553 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:11,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:31:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:12,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 13:31:12,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:12,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:31:13,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:31:13,508 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:31:13,557 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:31:13,596 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:31:14,706 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:14,706 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 51 treesize of output 48 [2024-11-13 13:31:14,726 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 20 treesize of output 1 [2024-11-13 13:31:15,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:15,254 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 51 treesize of output 48 [2024-11-13 13:31:15,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 13:31:15,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:15,840 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 51 treesize of output 48 [2024-11-13 13:31:15,861 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 20 treesize of output 1 [2024-11-13 13:31:16,410 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:16,410 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 51 treesize of output 48 [2024-11-13 13:31:16,448 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 20 treesize of output 1 [2024-11-13 13:31:16,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:31:16,979 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 51 treesize of output 48 [2024-11-13 13:31:17,018 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 20 treesize of output 1 [2024-11-13 13:31:17,304 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:31:17,487 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 13:31:17,487 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 97 treesize of output 63 [2024-11-13 13:31:17,524 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 42 treesize of output 25 [2024-11-13 13:31:18,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:31:18,272 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 13:31:18,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-13 13:31:18,313 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 42 treesize of output 25 [2024-11-13 13:31:18,506 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 19 [2024-11-13 13:31:18,965 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 13:31:18,965 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-13 13:31:18,992 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:31:18,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:19,191 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4658 (Array Int Int)) (v_ArrVal_4659 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4658))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (not (= v_ArrVal_4658 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) .cse2 (select v_ArrVal_4658 .cse2))))))) is different from false [2024-11-13 13:31:19,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4658 (Array Int Int)) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_4658))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select |c_#memory_$Pointer$#2.base| .cse2) .cse3 (select v_ArrVal_4658 .cse3))) v_ArrVal_4658)))))) is different from false [2024-11-13 13:31:19,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4657)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4658 .cse2))) v_ArrVal_4658)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select |c_#valid| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4658))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1))))) is different from false [2024-11-13 13:31:19,598 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 272 treesize of output 184 [2024-11-13 13:31:19,830 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_16|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4657)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4658))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4658 .cse5))) v_ArrVal_4658)))))) is different from false [2024-11-13 13:31:20,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| .cse6 (store (select |c_#memory_$Pointer$#2.base| .cse6) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| .cse6 v_ArrVal_4657)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4658 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4658 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4658))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))) is different from false [2024-11-13 13:31:20,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4654)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4653))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4657)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4658 .cse2))) v_ArrVal_4658)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4658))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))) is different from false [2024-11-13 13:31:20,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4653))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4657)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4658))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4658 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4658 .cse5))))))))))))) is different from false [2024-11-13 13:31:21,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4651 (Array Int Int)) (v_ArrVal_4652 (Array Int Int)) (v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4652)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4651) .cse9 v_ArrVal_4653))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4657)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4658 (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4658 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4658))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-13 13:31:21,506 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4651 (Array Int Int)) (v_ArrVal_4652 (Array Int Int)) (v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4652))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4651) .cse10 v_ArrVal_4653))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4657))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4658 .cse2))) v_ArrVal_4658)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4658))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-13 13:31:21,912 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4651 (Array Int Int)) (v_ArrVal_4652 (Array Int Int)) (v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4649 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4649)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4652))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4650) .cse9 v_ArrVal_4651) .cse10 v_ArrVal_4653))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4657))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4658))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4658 .cse5))) v_ArrVal_4658)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-13 13:31:22,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4651 (Array Int Int)) (v_ArrVal_4652 (Array Int Int)) (v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4649 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4649))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4652))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4650) .cse10 v_ArrVal_4651) .cse11 v_ArrVal_4653))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4657))) (or (not (= v_ArrVal_4658 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4658 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4658))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-13 13:31:22,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4651 (Array Int Int)) (v_ArrVal_4652 (Array Int Int)) (v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4648)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4649))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4652))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4647) .cse9 v_ArrVal_4650) .cse10 v_ArrVal_4651) .cse11 v_ArrVal_4653))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4657)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4658))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4658 .cse5))) v_ArrVal_4658)))))))))))))) is different from false [2024-11-13 13:31:22,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4651 (Array Int Int)) (v_ArrVal_4652 (Array Int Int)) (v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4648))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4649))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4652))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4647) .cse10 v_ArrVal_4650) .cse11 v_ArrVal_4651) .cse12 v_ArrVal_4653))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4657)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4658))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4658 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4658 .cse5))))))))))))))))))) is different from false [2024-11-13 13:31:23,707 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4651 (Array Int Int)) (v_ArrVal_4652 (Array Int Int)) (v_ArrVal_4664 (Array Int Int)) (v_ArrVal_4653 (Array Int Int)) (v_ArrVal_4665 (Array Int Int)) (v_ArrVal_4654 (Array Int Int)) (v_ArrVal_4657 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4658 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4665)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4648))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4649))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4652))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4654))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4664) .cse9 v_ArrVal_4647) .cse10 v_ArrVal_4650) .cse11 v_ArrVal_4651) .cse12 v_ArrVal_4653))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4657)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4658))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4658 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4658 .cse5))))))))))))))))))) is different from false [2024-11-13 13:31:23,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043616832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:23,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:31:23,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 29 [2024-11-13 13:31:23,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446170198] [2024-11-13 13:31:23,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:31:23,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:31:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:23,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:31:23,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=790, Unknown=14, NotChecked=966, Total=1892 [2024-11-13 13:31:23,728 INFO L87 Difference]: Start difference. First operand 925 states and 1072 transitions. Second operand has 30 states, 28 states have (on average 6.357142857142857) internal successors, (178), 29 states have internal predecessors, (178), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:32:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:16,787 INFO L93 Difference]: Finished difference Result 941 states and 1091 transitions. [2024-11-13 13:32:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:32:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 6.357142857142857) internal successors, (178), 29 states have internal predecessors, (178), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2024-11-13 13:32:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:16,791 INFO L225 Difference]: With dead ends: 941 [2024-11-13 13:32:16,791 INFO L226 Difference]: Without dead ends: 941 [2024-11-13 13:32:16,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=219, Invalid=1715, Unknown=14, NotChecked=1358, Total=3306 [2024-11-13 13:32:16,792 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 718 mSDsluCounter, 7602 mSDsCounter, 0 mSdLazyCounter, 5115 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 8086 SdHoareTripleChecker+Invalid, 5134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:16,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 8086 Invalid, 5134 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 5115 Invalid, 0 Unknown, 0 Unchecked, 49.8s Time] [2024-11-13 13:32:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-13 13:32:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 924. [2024-11-13 13:32:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 706 states have (on average 1.5042492917847026) internal successors, (1062), 917 states have internal predecessors, (1062), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 13:32:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1071 transitions. [2024-11-13 13:32:16,808 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1071 transitions. Word has length 117 [2024-11-13 13:32:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:16,808 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1071 transitions. [2024-11-13 13:32:16,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 6.357142857142857) internal successors, (178), 29 states have internal predecessors, (178), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:32:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1071 transitions. [2024-11-13 13:32:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 13:32:16,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:16,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:32:16,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 13:32:17,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:17,011 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 13:32:17,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash 98904415, now seen corresponding path program 1 times [2024-11-13 13:32:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723962079] [2024-11-13 13:32:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:24,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:32:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:24,793 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:32:24,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723962079] [2024-11-13 13:32:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723962079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333065709] [2024-11-13 13:32:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:24,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:24,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:24,795 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:24,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_683dbb21-098b-483d-a362-dd47d4641035/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:32:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:25,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 13:32:25,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:25,389 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:32:26,931 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:26,931 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:32:27,287 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:32:28,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:28,902 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 31 treesize of output 32 [2024-11-13 13:32:29,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:29,500 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 31 treesize of output 32 [2024-11-13 13:32:30,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:30,257 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 31 treesize of output 32 [2024-11-13 13:32:30,881 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:30,881 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 31 treesize of output 32 [2024-11-13 13:32:31,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:31,506 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 31 treesize of output 32 [2024-11-13 13:32:32,137 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:32:32,849 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 13:32:32,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-13 13:32:32,890 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-13 13:32:34,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:32:34,354 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 13:32:34,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-13 13:32:34,520 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-13 13:32:34,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-13 13:32:36,097 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-13 13:32:36,097 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-13 13:32:36,569 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:32:36,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:38,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (and (forall ((v_ArrVal_4892 (Array Int Int))) (or (forall ((v_ArrVal_4891 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4891 .cse1)) v_ArrVal_4891)) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4892)) (.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4891))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))) (not (= v_ArrVal_4892 (store .cse7 .cse1 (select v_ArrVal_4892 .cse1)))))) (forall ((v_ArrVal_4892 (Array Int Int))) (or (forall ((v_ArrVal_4891 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4891 .cse1)) v_ArrVal_4891)) (< 0 (+ (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4892))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)))) (not (= v_ArrVal_4892 (store .cse7 .cse1 (select v_ArrVal_4892 .cse1)))))))) is different from false [2024-11-13 13:32:38,877 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4892 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (forall ((v_ArrVal_4891 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4891 .cse1)) v_ArrVal_4891)) (< 0 (+ (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_4892))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_4891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1)))) (not (= (store .cse5 .cse1 (select v_ArrVal_4892 .cse1)) v_ArrVal_4892))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4892 (Array Int Int))) (let ((.cse7 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (forall ((v_ArrVal_4891 (Array Int Int))) (or (not (= (store .cse0 .cse7 (select v_ArrVal_4891 .cse7)) v_ArrVal_4891)) (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_4892)) (.cse11 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_4891))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse10 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select .cse8 .cse9) .cse10) 383) (select |c_#length| (select (select .cse11 .cse9) .cse10))))))) (not (= (store .cse5 .cse7 (select v_ArrVal_4892 .cse7)) v_ArrVal_4892))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse6))))))) is different from false [2024-11-13 13:32:40,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.offset|)))) (let ((.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse0 (select .cse6 .cse4)) (.cse7 (select .cse3 .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4892 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4892 .cse1)) v_ArrVal_4892)) (forall ((v_ArrVal_4891 (Array Int Int))) (or (< 0 (+ (let ((.cse2 (store .cse6 .cse4 v_ArrVal_4892))) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_4891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)) (not (= (store .cse7 .cse1 (select v_ArrVal_4891 .cse1)) v_ArrVal_4891))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse8))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse8) (forall ((v_ArrVal_4892 (Array Int Int))) (let ((.cse9 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (not (= (store .cse0 .cse9 (select v_ArrVal_4892 .cse9)) v_ArrVal_4892)) (forall ((v_ArrVal_4891 (Array Int Int))) (or (let ((.cse10 (store .cse6 .cse4 v_ArrVal_4892)) (.cse13 (store .cse3 .cse4 v_ArrVal_4891))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse12 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select .cse10 .cse11) .cse12) 383) (select |c_#length| (select (select .cse13 .cse11) .cse12))))) (not (= (store .cse7 .cse9 (select v_ArrVal_4891 .cse9)) v_ArrVal_4891))))))))))))) is different from false [2024-11-13 13:32:40,234 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 757 treesize of output 664 [2024-11-13 13:32:42,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_67 Int) (v_prenex_65 (Array Int Int)) (v_prenex_66 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse3 (+ 40 v_prenex_67)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (< v_prenex_67 .cse0) (not (= v_prenex_66 (store (select .cse1 .cse2) .cse3 (select v_prenex_66 .cse3)))) (not (= (store (select .cse4 .cse2) .cse3 (select v_prenex_65 .cse3)) v_prenex_65)) (< 0 (+ (let ((.cse5 (store .cse1 .cse2 v_prenex_66))) (select (select .cse5 (select (select (store .cse4 .cse2 v_prenex_65) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)))))) (forall ((v_ArrVal_4891 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4892 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse9 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (not (= (store (select .cse1 .cse8) .cse9 (select v_ArrVal_4892 .cse9)) v_ArrVal_4892)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse0) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse10 (store .cse11 .cse8 v_ArrVal_4891))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse1 .cse8 v_ArrVal_4892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (not (= v_ArrVal_4891 (store (select .cse11 .cse8) .cse9 (select v_ArrVal_4891 .cse9)))))))) (forall ((v_ArrVal_4891 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4892 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse15 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< (let ((.cse12 (store .cse1 .cse14 v_ArrVal_4892))) (select (select .cse12 (select (select (store .cse13 .cse14 v_ArrVal_4891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (select .cse1 .cse14) .cse15 (select v_ArrVal_4892 .cse15)) v_ArrVal_4892)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse0) (not (= v_ArrVal_4891 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4891 .cse15))))))))))) is different from false [2024-11-13 13:32:43,296 INFO L349 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2024-11-13 13:32:43,296 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 406 treesize of output 334 [2024-11-13 13:32:43,779 INFO L349 Elim1Store]: treesize reduction 50, result has 43.8 percent of original size [2024-11-13 13:32:43,780 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 377 treesize of output 375 [2024-11-13 13:32:45,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:32:45,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 987 treesize of output 975 [2024-11-13 13:32:58,623 INFO L349 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2024-11-13 13:32:58,623 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 408 treesize of output 316 [2024-11-13 13:32:58,829 INFO L224 Elim1Store]: Index analysis took 130 ms [2024-11-13 13:32:59,303 INFO L349 Elim1Store]: treesize reduction 176, result has 43.2 percent of original size [2024-11-13 13:32:59,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 651 treesize of output 628 [2024-11-13 13:33:00,743 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 5 [2024-11-13 13:33:03,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:33:03,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 440 treesize of output 537 [2024-11-13 13:33:06,121 INFO L349 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2024-11-13 13:33:06,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 351 treesize of output 363 [2024-11-13 13:33:08,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:33:08,535 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 13:33:08,535 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 358 treesize of output 1 [2024-11-13 13:33:12,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4887 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:33:12,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4887 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4886))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4887)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 13:33:17,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4885 (Array Int Int)) (v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4887 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4885))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4886)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4887)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:33:21,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4884 (Array Int Int)) (v_ArrVal_4885 (Array Int Int)) (v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4887 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4884))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4885)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4886)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4887)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:33:21,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4884 (Array Int Int)) (v_ArrVal_4885 (Array Int Int)) (v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4887 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4884))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4885)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4886)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4887)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:33:22,011 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4895 (Array Int Int)) (v_ArrVal_4884 (Array Int Int)) (v_ArrVal_4885 (Array Int Int)) (v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4887 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4895))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4884)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4885)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4886)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4887)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 13:33:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333065709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:22,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:33:22,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2024-11-13 13:33:22,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630898088] [2024-11-13 13:33:22,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:33:22,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 13:33:22,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:33:22,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 13:33:22,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1692, Unknown=24, NotChecked=930, Total=2862 [2024-11-13 13:33:22,024 INFO L87 Difference]: Start difference. First operand 924 states and 1071 transitions. Second operand has 38 states, 35 states have (on average 5.542857142857143) internal successors, (194), 37 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)