./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:51:02,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:51:03,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 19:51:03,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:51:03,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:51:03,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:51:03,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:51:03,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:51:03,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:51:03,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:51:03,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:51:03,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:51:03,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:51:03,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:51:03,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:51:03,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:51:03,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:51:03,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:51:03,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:51:03,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:51:03,138 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 19:51:03,138 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 19:51:03,139 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 19:51:03,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:51:03,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:51:03,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 19:51:03,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:51:03,139 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:51:03,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:51:03,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:51:03,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:51:03,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:51:03,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:51:03,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:03,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:51:03,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:51:03,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:51:03,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:51:03,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:03,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:51:03,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:51:03,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:51:03,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:51:03,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:51:03,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:51:03,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:51:03,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:51:03,142 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_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 [2024-11-27 19:51:03,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:51:03,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:51:03,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:51:03,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:51:03,475 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:51:03,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2024-11-27 19:51:06,395 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/data/87329f2f0/e7edcbaefee544b8adce6e276a5e16a3/FLAGf02cc0346 [2024-11-27 19:51:09,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:51:09,091 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2024-11-27 19:51:09,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/data/87329f2f0/e7edcbaefee544b8adce6e276a5e16a3/FLAGf02cc0346 [2024-11-27 19:51:09,161 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/data/87329f2f0/e7edcbaefee544b8adce6e276a5e16a3 [2024-11-27 19:51:09,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:51:09,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:51:09,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:51:09,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:51:09,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:51:09,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:51:09" (1/1) ... [2024-11-27 19:51:09,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b164dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:09, skipping insertion in model container [2024-11-27 19:51:09,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:51:09" (1/1) ... [2024-11-27 19:51:09,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:51:10,022 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,056 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,061 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,065 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,071 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,106 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,107 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,111 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,111 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:51:10,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:51:10,141 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:51:10,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:51:10,431 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:51:10,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10 WrapperNode [2024-11-27 19:51:10,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:51:10,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:51:10,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:51:10,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:51:10,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,670 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3262 [2024-11-27 19:51:10,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:51:10,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:51:10,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:51:10,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:51:10,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,808 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-27 19:51:10,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:51:10,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:51:10,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:51:10,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:51:10,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (1/1) ... [2024-11-27 19:51:10,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:11,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:51:11,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:51:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-27 19:51:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-27 19:51:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:51:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:51:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 19:51:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 19:51:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 19:51:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:51:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:51:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 19:51:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-27 19:51:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-27 19:51:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-27 19:51:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-27 19:51:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-27 19:51:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-27 19:51:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 19:51:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:51:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 19:51:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 19:51:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 19:51:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 19:51:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:51:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:51:11,370 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:51:11,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:51:11,401 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 19:51:11,440 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 19:51:11,468 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 19:51:15,977 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2024-11-27 19:51:15,977 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:51:16,063 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:51:16,063 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-27 19:51:16,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:51:16 BoogieIcfgContainer [2024-11-27 19:51:16,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:51:16,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:51:16,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:51:16,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:51:16,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:51:09" (1/3) ... [2024-11-27 19:51:16,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492e9769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:51:16, skipping insertion in model container [2024-11-27 19:51:16,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:10" (2/3) ... [2024-11-27 19:51:16,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492e9769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:51:16, skipping insertion in model container [2024-11-27 19:51:16,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:51:16" (3/3) ... [2024-11-27 19:51:16,079 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-1.i [2024-11-27 19:51:16,096 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:51:16,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test9-1.i that has 6 procedures, 2077 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2024-11-27 19:51:16,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:51:16,225 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;@5dd25278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:51:16,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-27 19:51:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 2067 states, 1137 states have (on average 2.006156552330695) internal successors, (2281), 2060 states have internal predecessors, (2281), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-27 19:51:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 19:51:16,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:16,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 19:51:16,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:16,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-27 19:51:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848392029] [2024-11-27 19:51:16,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:16,488 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-27 19:51:16,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848392029] [2024-11-27 19:51:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848392029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:16,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:16,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:51:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139605565] [2024-11-27 19:51:16,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:16,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:51:16,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:16,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:51:16,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:16,540 INFO L87 Difference]: Start difference. First operand has 2067 states, 1137 states have (on average 2.006156552330695) internal successors, (2281), 2060 states have internal predecessors, (2281), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:18,352 INFO L93 Difference]: Finished difference Result 2053 states and 3217 transitions. [2024-11-27 19:51:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:51:18,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-27 19:51:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:18,407 INFO L225 Difference]: With dead ends: 2053 [2024-11-27 19:51:18,408 INFO L226 Difference]: Without dead ends: 2051 [2024-11-27 19:51:18,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:18,414 INFO L435 NwaCegarLoop]: 2828 mSDtfsCounter, 2092 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2595 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:18,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2595 Valid, 2880 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-27 19:51:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2024-11-27 19:51:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2024-11-27 19:51:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1139 states have (on average 1.9376646180860404) internal successors, (2207), 2044 states have internal predecessors, (2207), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-27 19:51:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 3215 transitions. [2024-11-27 19:51:18,965 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 3215 transitions. Word has length 3 [2024-11-27 19:51:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:18,965 INFO L471 AbstractCegarLoop]: Abstraction has 2051 states and 3215 transitions. [2024-11-27 19:51:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 3215 transitions. [2024-11-27 19:51:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 19:51:18,966 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:18,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 19:51:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:51:18,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-27 19:51:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392871075] [2024-11-27 19:51:18,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:19,104 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-27 19:51:19,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392871075] [2024-11-27 19:51:19,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392871075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:19,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:51:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457667242] [2024-11-27 19:51:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:19,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:51:19,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:19,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:51:19,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:19,108 INFO L87 Difference]: Start difference. First operand 2051 states and 3215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:21,382 INFO L93 Difference]: Finished difference Result 3816 states and 6132 transitions. [2024-11-27 19:51:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:51:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-27 19:51:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:21,406 INFO L225 Difference]: With dead ends: 3816 [2024-11-27 19:51:21,406 INFO L226 Difference]: Without dead ends: 3816 [2024-11-27 19:51:21,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:21,408 INFO L435 NwaCegarLoop]: 2930 mSDtfsCounter, 1909 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 5211 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:21,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 5211 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-27 19:51:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2024-11-27 19:51:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3552. [2024-11-27 19:51:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3552 states, 2141 states have (on average 1.9196637085474078) internal successors, (4110), 3543 states have internal predecessors, (4110), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 6122 transitions. [2024-11-27 19:51:21,843 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 6122 transitions. Word has length 3 [2024-11-27 19:51:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:21,843 INFO L471 AbstractCegarLoop]: Abstraction has 3552 states and 6122 transitions. [2024-11-27 19:51:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 6122 transitions. [2024-11-27 19:51:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 19:51:21,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:21,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:21,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:51:21,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:21,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2024-11-27 19:51:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177423146] [2024-11-27 19:51:21,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:21,969 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-27 19:51:21,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177423146] [2024-11-27 19:51:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177423146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:51:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953371680] [2024-11-27 19:51:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:21,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:51:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:21,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:51:21,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:21,972 INFO L87 Difference]: Start difference. First operand 3552 states and 6122 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-27 19:51:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:23,801 INFO L93 Difference]: Finished difference Result 4816 states and 8440 transitions. [2024-11-27 19:51:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:51:23,802 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-27 19:51:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:23,827 INFO L225 Difference]: With dead ends: 4816 [2024-11-27 19:51:23,828 INFO L226 Difference]: Without dead ends: 4816 [2024-11-27 19:51:23,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:23,831 INFO L435 NwaCegarLoop]: 4984 mSDtfsCounter, 2077 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2580 SdHoareTripleChecker+Valid, 7290 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:23,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2580 Valid, 7290 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-27 19:51:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2024-11-27 19:51:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 3505. [2024-11-27 19:51:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 2141 states have (on average 1.8865016347501167) internal successors, (4039), 3496 states have internal predecessors, (4039), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 6051 transitions. [2024-11-27 19:51:24,459 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 6051 transitions. Word has length 9 [2024-11-27 19:51:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:24,459 INFO L471 AbstractCegarLoop]: Abstraction has 3505 states and 6051 transitions. [2024-11-27 19:51:24,459 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-27 19:51:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 6051 transitions. [2024-11-27 19:51:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 19:51:24,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:24,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:24,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:51:24,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:24,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2024-11-27 19:51:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:24,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851481685] [2024-11-27 19:51:24,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:24,656 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-27 19:51:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851481685] [2024-11-27 19:51:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851481685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:24,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:51:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142461540] [2024-11-27 19:51:24,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:24,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:51:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:24,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:51:24,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:24,657 INFO L87 Difference]: Start difference. First operand 3505 states and 6051 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-27 19:51:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:26,429 INFO L93 Difference]: Finished difference Result 6027 states and 10789 transitions. [2024-11-27 19:51:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:51:26,430 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-27 19:51:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:26,461 INFO L225 Difference]: With dead ends: 6027 [2024-11-27 19:51:26,461 INFO L226 Difference]: Without dead ends: 6027 [2024-11-27 19:51:26,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:26,465 INFO L435 NwaCegarLoop]: 5129 mSDtfsCounter, 1869 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 7552 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:26,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 7552 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-27 19:51:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2024-11-27 19:51:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3480. [2024-11-27 19:51:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 2141 states have (on average 1.8636151331153668) internal successors, (3990), 3471 states have internal predecessors, (3990), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6002 transitions. [2024-11-27 19:51:27,256 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6002 transitions. Word has length 9 [2024-11-27 19:51:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:27,256 INFO L471 AbstractCegarLoop]: Abstraction has 3480 states and 6002 transitions. [2024-11-27 19:51:27,256 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-27 19:51:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6002 transitions. [2024-11-27 19:51:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 19:51:27,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:27,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:27,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:51:27,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1246059725, now seen corresponding path program 1 times [2024-11-27 19:51:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046332065] [2024-11-27 19:51:27,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:27,414 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-27 19:51:27,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:27,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046332065] [2024-11-27 19:51:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046332065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:27,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:27,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458737782] [2024-11-27 19:51:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:27,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:27,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:27,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:27,416 INFO L87 Difference]: Start difference. First operand 3480 states and 6002 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:28,405 INFO L93 Difference]: Finished difference Result 6645 states and 11501 transitions. [2024-11-27 19:51:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:28,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-27 19:51:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:28,450 INFO L225 Difference]: With dead ends: 6645 [2024-11-27 19:51:28,455 INFO L226 Difference]: Without dead ends: 6645 [2024-11-27 19:51:28,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:28,455 INFO L435 NwaCegarLoop]: 3138 mSDtfsCounter, 2091 mSDsluCounter, 5714 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 8852 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:28,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 8852 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 19:51:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2024-11-27 19:51:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 3482. [2024-11-27 19:51:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3482 states, 2143 states have (on average 1.8628091460569296) internal successors, (3992), 3473 states have internal predecessors, (3992), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 6004 transitions. [2024-11-27 19:51:29,093 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 6004 transitions. Word has length 10 [2024-11-27 19:51:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:29,093 INFO L471 AbstractCegarLoop]: Abstraction has 3482 states and 6004 transitions. [2024-11-27 19:51:29,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 6004 transitions. [2024-11-27 19:51:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 19:51:29,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:29,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:29,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:51:29,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:29,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash 495195041, now seen corresponding path program 1 times [2024-11-27 19:51:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665582603] [2024-11-27 19:51:29,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:29,222 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-27 19:51:29,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:29,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665582603] [2024-11-27 19:51:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665582603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:29,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:51:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286251448] [2024-11-27 19:51:29,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:29,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:29,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:29,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:29,224 INFO L87 Difference]: Start difference. First operand 3482 states and 6004 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-27 19:51:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:32,607 INFO L93 Difference]: Finished difference Result 3558 states and 6111 transitions. [2024-11-27 19:51:32,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:32,608 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-27 19:51:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:32,622 INFO L225 Difference]: With dead ends: 3558 [2024-11-27 19:51:32,622 INFO L226 Difference]: Without dead ends: 3558 [2024-11-27 19:51:32,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:32,623 INFO L435 NwaCegarLoop]: 2730 mSDtfsCounter, 2342 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2845 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:32,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2845 Valid, 4333 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-27 19:51:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2024-11-27 19:51:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3459. [2024-11-27 19:51:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2143 states have (on average 1.841343910405973) internal successors, (3946), 3450 states have internal predecessors, (3946), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5958 transitions. [2024-11-27 19:51:33,025 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5958 transitions. Word has length 19 [2024-11-27 19:51:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:33,025 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 5958 transitions. [2024-11-27 19:51:33,025 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-27 19:51:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5958 transitions. [2024-11-27 19:51:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 19:51:33,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:33,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:33,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:51:33,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:33,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 495195042, now seen corresponding path program 1 times [2024-11-27 19:51:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151074238] [2024-11-27 19:51:33,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:33,134 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-27 19:51:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151074238] [2024-11-27 19:51:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151074238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:33,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:33,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:51:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590566305] [2024-11-27 19:51:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:33,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:51:33,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:33,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:51:33,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:33,135 INFO L87 Difference]: Start difference. First operand 3459 states and 5958 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-27 19:51:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:33,189 INFO L93 Difference]: Finished difference Result 3321 states and 5752 transitions. [2024-11-27 19:51:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:51:33,190 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-27 19:51:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:33,204 INFO L225 Difference]: With dead ends: 3321 [2024-11-27 19:51:33,204 INFO L226 Difference]: Without dead ends: 3321 [2024-11-27 19:51:33,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:33,205 INFO L435 NwaCegarLoop]: 2995 mSDtfsCounter, 61 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5937 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-27 19:51:33,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5937 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2024-11-27 19:51:33,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3321. [2024-11-27 19:51:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 2017 states have (on average 1.8542389687654932) internal successors, (3740), 3312 states have internal predecessors, (3740), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5752 transitions. [2024-11-27 19:51:33,646 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5752 transitions. Word has length 19 [2024-11-27 19:51:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:33,647 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5752 transitions. [2024-11-27 19:51:33,648 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-27 19:51:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5752 transitions. [2024-11-27 19:51:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-27 19:51:33,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:33,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:33,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:51:33,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:33,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -858657125, now seen corresponding path program 1 times [2024-11-27 19:51:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:33,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864421226] [2024-11-27 19:51:33,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:33,763 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-27 19:51:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864421226] [2024-11-27 19:51:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864421226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:33,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051272523] [2024-11-27 19:51:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:33,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:33,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:33,764 INFO L87 Difference]: Start difference. First operand 3321 states and 5752 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-27 19:51:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:33,875 INFO L93 Difference]: Finished difference Result 3292 states and 5702 transitions. [2024-11-27 19:51:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:33,878 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-27 19:51:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:33,892 INFO L225 Difference]: With dead ends: 3292 [2024-11-27 19:51:33,893 INFO L226 Difference]: Without dead ends: 3292 [2024-11-27 19:51:33,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:33,894 INFO L435 NwaCegarLoop]: 2960 mSDtfsCounter, 41 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8852 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-27 19:51:33,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8852 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2024-11-27 19:51:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3286. [2024-11-27 19:51:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 1989 states have (on average 1.852187028657617) internal successors, (3684), 3277 states have internal predecessors, (3684), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 5696 transitions. [2024-11-27 19:51:34,416 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 5696 transitions. Word has length 21 [2024-11-27 19:51:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:34,417 INFO L471 AbstractCegarLoop]: Abstraction has 3286 states and 5696 transitions. [2024-11-27 19:51:34,417 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-27 19:51:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 5696 transitions. [2024-11-27 19:51:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 19:51:34,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:34,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:34,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:51:34,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:34,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash -496287351, now seen corresponding path program 1 times [2024-11-27 19:51:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:34,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179128835] [2024-11-27 19:51:34,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:34,674 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-27 19:51:34,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179128835] [2024-11-27 19:51:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179128835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:51:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542793201] [2024-11-27 19:51:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:34,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:34,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:34,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:34,678 INFO L87 Difference]: Start difference. First operand 3286 states and 5696 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-27 19:51:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:38,107 INFO L93 Difference]: Finished difference Result 6062 states and 10807 transitions. [2024-11-27 19:51:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:38,107 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-27 19:51:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:38,132 INFO L225 Difference]: With dead ends: 6062 [2024-11-27 19:51:38,132 INFO L226 Difference]: Without dead ends: 6062 [2024-11-27 19:51:38,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:38,134 INFO L435 NwaCegarLoop]: 2799 mSDtfsCounter, 1818 mSDsluCounter, 3582 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 6381 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:38,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 6381 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-27 19:51:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2024-11-27 19:51:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3282. [2024-11-27 19:51:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 1989 states have (on average 1.8481649069884365) internal successors, (3676), 3273 states have internal predecessors, (3676), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 5688 transitions. [2024-11-27 19:51:38,881 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 5688 transitions. Word has length 35 [2024-11-27 19:51:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:38,882 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 5688 transitions. [2024-11-27 19:51:38,882 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-27 19:51:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 5688 transitions. [2024-11-27 19:51:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-27 19:51:38,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:38,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:51:38,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:51:38,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:38,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash -907140769, now seen corresponding path program 1 times [2024-11-27 19:51:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:38,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505921276] [2024-11-27 19:51:38,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:38,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:39,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-27 19:51:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505921276] [2024-11-27 19:51:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505921276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:39,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199381950] [2024-11-27 19:51:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:39,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:39,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:39,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:39,106 INFO L87 Difference]: Start difference. First operand 3282 states and 5688 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-27 19:51:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:39,207 INFO L93 Difference]: Finished difference Result 3282 states and 5680 transitions. [2024-11-27 19:51:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:39,208 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-27 19:51:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:39,224 INFO L225 Difference]: With dead ends: 3282 [2024-11-27 19:51:39,224 INFO L226 Difference]: Without dead ends: 3282 [2024-11-27 19:51:39,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:39,226 INFO L435 NwaCegarLoop]: 2955 mSDtfsCounter, 21 mSDsluCounter, 5879 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8834 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-27 19:51:39,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8834 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2024-11-27 19:51:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3282. [2024-11-27 19:51:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 1989 states have (on average 1.844142785319256) internal successors, (3668), 3273 states have internal predecessors, (3668), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-27 19:51:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 5680 transitions. [2024-11-27 19:51:39,638 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 5680 transitions. Word has length 69 [2024-11-27 19:51:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:39,639 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 5680 transitions. [2024-11-27 19:51:39,639 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-27 19:51:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 5680 transitions. [2024-11-27 19:51:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-27 19:51:39,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:39,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:51:39,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:51:39,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:39,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1031867989, now seen corresponding path program 1 times [2024-11-27 19:51:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420924414] [2024-11-27 19:51:39,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:39,922 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-27 19:51:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:39,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420924414] [2024-11-27 19:51:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420924414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:39,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:51:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111417947] [2024-11-27 19:51:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:39,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:51:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:39,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:51:39,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:39,924 INFO L87 Difference]: Start difference. First operand 3282 states and 5680 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:40,052 INFO L93 Difference]: Finished difference Result 5793 states and 10403 transitions. [2024-11-27 19:51:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:51:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-27 19:51:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:40,075 INFO L225 Difference]: With dead ends: 5793 [2024-11-27 19:51:40,075 INFO L226 Difference]: Without dead ends: 5793 [2024-11-27 19:51:40,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:51:40,077 INFO L435 NwaCegarLoop]: 3264 mSDtfsCounter, 1354 mSDsluCounter, 2925 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 6189 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-27 19:51:40,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 6189 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2024-11-27 19:51:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5736. [2024-11-27 19:51:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5736 states, 3443 states have (on average 1.8553586988091781) internal successors, (6388), 5727 states have internal predecessors, (6388), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:51:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5736 states to 5736 states and 10400 transitions. [2024-11-27 19:51:40,703 INFO L78 Accepts]: Start accepts. Automaton has 5736 states and 10400 transitions. Word has length 77 [2024-11-27 19:51:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:40,703 INFO L471 AbstractCegarLoop]: Abstraction has 5736 states and 10400 transitions. [2024-11-27 19:51:40,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5736 states and 10400 transitions. [2024-11-27 19:51:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 19:51:40,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:40,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:51:40,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 19:51:40,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:40,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash 646450878, now seen corresponding path program 1 times [2024-11-27 19:51:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464377768] [2024-11-27 19:51:40,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:41,284 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-27 19:51:41,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464377768] [2024-11-27 19:51:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464377768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870890905] [2024-11-27 19:51:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:41,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:41,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:41,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:41,287 INFO L87 Difference]: Start difference. First operand 5736 states and 10400 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-27 19:51:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:42,329 INFO L93 Difference]: Finished difference Result 5735 states and 10398 transitions. [2024-11-27 19:51:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:51:42,330 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-27 19:51:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:42,354 INFO L225 Difference]: With dead ends: 5735 [2024-11-27 19:51:42,354 INFO L226 Difference]: Without dead ends: 5735 [2024-11-27 19:51:42,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:42,355 INFO L435 NwaCegarLoop]: 2966 mSDtfsCounter, 2 mSDsluCounter, 7907 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10873 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:42,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10873 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 19:51:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2024-11-27 19:51:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5735. [2024-11-27 19:51:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3443 states have (on average 1.8547778100493755) internal successors, (6386), 5726 states have internal predecessors, (6386), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:51:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10398 transitions. [2024-11-27 19:51:42,953 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10398 transitions. Word has length 85 [2024-11-27 19:51:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:42,954 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10398 transitions. [2024-11-27 19:51:42,954 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-27 19:51:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10398 transitions. [2024-11-27 19:51:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 19:51:42,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:42,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:51:42,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 19:51:42,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:42,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 646450879, now seen corresponding path program 1 times [2024-11-27 19:51:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857839574] [2024-11-27 19:51:42,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:43,591 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-27 19:51:43,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:43,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857839574] [2024-11-27 19:51:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857839574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:43,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362770181] [2024-11-27 19:51:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:43,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:43,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:43,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:43,596 INFO L87 Difference]: Start difference. First operand 5735 states and 10398 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-27 19:51:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:44,727 INFO L93 Difference]: Finished difference Result 5734 states and 10396 transitions. [2024-11-27 19:51:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:51:44,727 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-27 19:51:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:44,747 INFO L225 Difference]: With dead ends: 5734 [2024-11-27 19:51:44,747 INFO L226 Difference]: Without dead ends: 5734 [2024-11-27 19:51:44,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:44,750 INFO L435 NwaCegarLoop]: 2966 mSDtfsCounter, 1 mSDsluCounter, 7845 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10811 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:44,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10811 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 19:51:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2024-11-27 19:51:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 5734. [2024-11-27 19:51:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 3441 states have (on average 1.855274629468178) internal successors, (6384), 5725 states have internal predecessors, (6384), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:51:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 10396 transitions. [2024-11-27 19:51:45,276 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 10396 transitions. Word has length 85 [2024-11-27 19:51:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:45,277 INFO L471 AbstractCegarLoop]: Abstraction has 5734 states and 10396 transitions. [2024-11-27 19:51:45,277 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-27 19:51:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 10396 transitions. [2024-11-27 19:51:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 19:51:45,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:45,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:51:45,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:51:45,278 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:45,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash 957747781, now seen corresponding path program 1 times [2024-11-27 19:51:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620618649] [2024-11-27 19:51:45,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:45,639 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-27 19:51:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620618649] [2024-11-27 19:51:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620618649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:45,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:51:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051410605] [2024-11-27 19:51:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:45,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:51:45,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:45,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:51:45,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:45,642 INFO L87 Difference]: Start difference. First operand 5734 states and 10396 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-27 19:51:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:50,400 INFO L93 Difference]: Finished difference Result 5752 states and 10422 transitions. [2024-11-27 19:51:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:51:50,401 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-27 19:51:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:50,427 INFO L225 Difference]: With dead ends: 5752 [2024-11-27 19:51:50,427 INFO L226 Difference]: Without dead ends: 5752 [2024-11-27 19:51:50,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:50,427 INFO L435 NwaCegarLoop]: 2951 mSDtfsCounter, 13 mSDsluCounter, 8399 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11350 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:50,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11350 Invalid, 3997 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-27 19:51:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5752 states. [2024-11-27 19:51:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5752 to 5743. [2024-11-27 19:51:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 3449 states have (on average 1.8541606262684835) internal successors, (6395), 5732 states have internal predecessors, (6395), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-27 19:51:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 10412 transitions. [2024-11-27 19:51:51,361 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 10412 transitions. Word has length 93 [2024-11-27 19:51:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:51,362 INFO L471 AbstractCegarLoop]: Abstraction has 5743 states and 10412 transitions. [2024-11-27 19:51:51,362 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-27 19:51:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 10412 transitions. [2024-11-27 19:51:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 19:51:51,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:51,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:51:51,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:51:51,363 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:51,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash 957747782, now seen corresponding path program 1 times [2024-11-27 19:51:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:51,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060082586] [2024-11-27 19:51:51,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:52,234 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-27 19:51:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060082586] [2024-11-27 19:51:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060082586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569494794] [2024-11-27 19:51:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:52,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:51:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:52,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:51:52,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:52,236 INFO L87 Difference]: Start difference. First operand 5743 states and 10412 transitions. Second operand has 6 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-27 19:51:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:56,662 INFO L93 Difference]: Finished difference Result 5743 states and 10410 transitions. [2024-11-27 19:51:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:51:56,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-27 19:51:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:56,679 INFO L225 Difference]: With dead ends: 5743 [2024-11-27 19:51:56,680 INFO L226 Difference]: Without dead ends: 5743 [2024-11-27 19:51:56,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:56,680 INFO L435 NwaCegarLoop]: 2955 mSDtfsCounter, 8 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11117 SdHoareTripleChecker+Invalid, 3712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:56,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11117 Invalid, 3712 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [503 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-27 19:51:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2024-11-27 19:51:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 5743. [2024-11-27 19:51:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 3449 states have (on average 1.853580748042911) internal successors, (6393), 5732 states have internal predecessors, (6393), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-27 19:51:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 10410 transitions. [2024-11-27 19:51:57,424 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 10410 transitions. Word has length 93 [2024-11-27 19:51:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:57,424 INFO L471 AbstractCegarLoop]: Abstraction has 5743 states and 10410 transitions. [2024-11-27 19:51:57,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-27 19:51:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 10410 transitions. [2024-11-27 19:51:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 19:51:57,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:57,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:51:57,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:51:57,426 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:51:57,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1828392253, now seen corresponding path program 1 times [2024-11-27 19:51:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:57,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643040348] [2024-11-27 19:51:57,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:58,079 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-27 19:51:58,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:58,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643040348] [2024-11-27 19:51:58,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643040348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:58,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964374476] [2024-11-27 19:51:58,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:58,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:58,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:58,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:51:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:58,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-27 19:51:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:58,484 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:51:58,485 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-27 19:51:58,528 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-27 19:51:58,636 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-27 19:51:58,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:51:58,880 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-27 19:51:58,950 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-27 19:51:58,991 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-27 19:51:58,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:59,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964374476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:59,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:51:59,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-27 19:51:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963328632] [2024-11-27 19:51:59,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:59,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 19:51:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:59,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 19:51:59,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2024-11-27 19:51:59,083 INFO L87 Difference]: Start difference. First operand 5743 states and 10410 transitions. Second operand has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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-27 19:52:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:09,751 INFO L93 Difference]: Finished difference Result 5750 states and 10416 transitions. [2024-11-27 19:52:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:52:09,752 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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-27 19:52:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:09,767 INFO L225 Difference]: With dead ends: 5750 [2024-11-27 19:52:09,768 INFO L226 Difference]: Without dead ends: 5750 [2024-11-27 19:52:09,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2024-11-27 19:52:09,769 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1900 mSDsluCounter, 17560 mSDsCounter, 0 mSdLazyCounter, 12481 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 20179 SdHoareTripleChecker+Invalid, 12998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 12481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:09,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 20179 Invalid, 12998 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 12481 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-27 19:52:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2024-11-27 19:52:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 5747. [2024-11-27 19:52:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 3453 states have (on average 1.8523023457862728) internal successors, (6396), 5735 states have internal predecessors, (6396), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:52:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 10410 transitions. [2024-11-27 19:52:10,424 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 10410 transitions. Word has length 94 [2024-11-27 19:52:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:10,424 INFO L471 AbstractCegarLoop]: Abstraction has 5747 states and 10410 transitions. [2024-11-27 19:52:10,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.4375) internal successors, (119), 18 states have internal predecessors, (119), 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-27 19:52:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 10410 transitions. [2024-11-27 19:52:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 19:52:10,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:10,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:52:10,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 19:52:10,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 19:52:10,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:52:10,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1828392254, now seen corresponding path program 1 times [2024-11-27 19:52:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:52:10,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780587994] [2024-11-27 19:52:10,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:52:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:11,709 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-27 19:52:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:52:11,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780587994] [2024-11-27 19:52:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780587994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:11,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119076633] [2024-11-27 19:52:11,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:11,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:52:11,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:52:11,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:52:11,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:52:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:11,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-27 19:52:11,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:52:12,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 19:52:12,097 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-27 19:52:12,104 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-27 19:52:12,141 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-27 19:52:12,145 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-27 19:52:12,257 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-27 19:52:12,262 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-27 19:52:12,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:52:12,398 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-27 19:52:12,408 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-27 19:52:12,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 19:52:12,459 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-27 19:52:12,482 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-27 19:52:12,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:52:12,600 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_729) |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_728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_729 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-27 19:52:12,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119076633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:12,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:52:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-27 19:52:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519388872] [2024-11-27 19:52:12,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:52:12,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 19:52:12,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:52:12,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 19:52:12,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-27 19:52:12,605 INFO L87 Difference]: Start difference. First operand 5747 states and 10410 transitions. Second operand has 18 states, 15 states have (on average 7.933333333333334) internal successors, (119), 18 states have internal predecessors, (119), 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-27 19:52:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:26,168 INFO L93 Difference]: Finished difference Result 5749 states and 10414 transitions. [2024-11-27 19:52:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 19:52:26,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.933333333333334) internal successors, (119), 18 states have internal predecessors, (119), 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-27 19:52:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:26,183 INFO L225 Difference]: With dead ends: 5749 [2024-11-27 19:52:26,184 INFO L226 Difference]: Without dead ends: 5749 [2024-11-27 19:52:26,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-27 19:52:26,185 INFO L435 NwaCegarLoop]: 2622 mSDtfsCounter, 1904 mSDsluCounter, 18242 mSDsCounter, 0 mSdLazyCounter, 10702 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 20864 SdHoareTripleChecker+Invalid, 11221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 10702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:26,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 20864 Invalid, 11221 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [519 Valid, 10702 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-27 19:52:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5749 states. [2024-11-27 19:52:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5749 to 5737. [2024-11-27 19:52:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5737 states, 3445 states have (on average 1.853410740203193) internal successors, (6385), 5727 states have internal predecessors, (6385), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:52:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 10397 transitions. [2024-11-27 19:52:26,845 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 10397 transitions. Word has length 94 [2024-11-27 19:52:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:26,846 INFO L471 AbstractCegarLoop]: Abstraction has 5737 states and 10397 transitions. [2024-11-27 19:52:26,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.933333333333334) internal successors, (119), 18 states have internal predecessors, (119), 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-27 19:52:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 10397 transitions. [2024-11-27 19:52:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 19:52:26,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:26,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:52:26,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 19:52:27,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-27 19:52:27,051 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:52:27,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash 797042921, now seen corresponding path program 1 times [2024-11-27 19:52:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:52:27,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048335637] [2024-11-27 19:52:27,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:27,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:52:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:27,746 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-27 19:52:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:52:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048335637] [2024-11-27 19:52:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048335637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:52:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:52:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-27 19:52:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157593665] [2024-11-27 19:52:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:52:27,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 19:52:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:52:27,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 19:52:27,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-27 19:52:27,750 INFO L87 Difference]: Start difference. First operand 5737 states and 10397 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-27 19:52:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:34,190 INFO L93 Difference]: Finished difference Result 5756 states and 10422 transitions. [2024-11-27 19:52:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 19:52:34,190 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-27 19:52:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:34,202 INFO L225 Difference]: With dead ends: 5756 [2024-11-27 19:52:34,202 INFO L226 Difference]: Without dead ends: 5756 [2024-11-27 19:52:34,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-27 19:52:34,203 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1892 mSDsluCounter, 12721 mSDsCounter, 0 mSdLazyCounter, 8916 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 15340 SdHoareTripleChecker+Invalid, 9430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 8916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:34,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 15340 Invalid, 9430 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 8916 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-27 19:52:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2024-11-27 19:52:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 5752. [2024-11-27 19:52:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 3459 states have (on average 1.8508239375542064) internal successors, (6402), 5740 states have internal predecessors, (6402), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:52:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 10416 transitions. [2024-11-27 19:52:34,668 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 10416 transitions. Word has length 96 [2024-11-27 19:52:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:34,668 INFO L471 AbstractCegarLoop]: Abstraction has 5752 states and 10416 transitions. [2024-11-27 19:52:34,668 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-27 19:52:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 10416 transitions. [2024-11-27 19:52:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 19:52:34,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:34,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:52:34,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 19:52:34,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:52:34,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 797042922, now seen corresponding path program 1 times [2024-11-27 19:52:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:52:34,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432992314] [2024-11-27 19:52:34,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:52:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:35,568 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-27 19:52:35,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:52:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432992314] [2024-11-27 19:52:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432992314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:52:35,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:52:35,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:52:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704514851] [2024-11-27 19:52:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:52:35,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:52:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:52:35,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:52:35,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:52:35,572 INFO L87 Difference]: Start difference. First operand 5752 states and 10416 transitions. Second operand has 11 states, 10 states have (on average 9.4) 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-27 19:52:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:44,004 INFO L93 Difference]: Finished difference Result 5755 states and 10420 transitions. [2024-11-27 19:52:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:52:44,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) 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-27 19:52:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:44,013 INFO L225 Difference]: With dead ends: 5755 [2024-11-27 19:52:44,013 INFO L226 Difference]: Without dead ends: 5755 [2024-11-27 19:52:44,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:52:44,014 INFO L435 NwaCegarLoop]: 2623 mSDtfsCounter, 1902 mSDsluCounter, 13187 mSDsCounter, 0 mSdLazyCounter, 7376 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 15810 SdHoareTripleChecker+Invalid, 7888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 7376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:44,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 15810 Invalid, 7888 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 7376 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-27 19:52:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2024-11-27 19:52:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5752. [2024-11-27 19:52:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 3459 states have (on average 1.8502457357617808) internal successors, (6400), 5740 states have internal predecessors, (6400), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:52:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 10414 transitions. [2024-11-27 19:52:44,555 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 10414 transitions. Word has length 96 [2024-11-27 19:52:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:44,556 INFO L471 AbstractCegarLoop]: Abstraction has 5752 states and 10414 transitions. [2024-11-27 19:52:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) 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-27 19:52:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 10414 transitions. [2024-11-27 19:52:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-27 19:52:44,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:44,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:52:44,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 19:52:44,557 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:52:44,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash 859007729, now seen corresponding path program 1 times [2024-11-27 19:52:44,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:52:44,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189973713] [2024-11-27 19:52:44,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:52:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:45,233 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-27 19:52:45,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:52:45,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189973713] [2024-11-27 19:52:45,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189973713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:45,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449832583] [2024-11-27 19:52:45,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:52:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:52:45,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:52:45,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 19:52:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:45,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 19:52:45,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:52:45,673 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:52:45,673 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-27 19:52:45,718 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-27 19:52:45,821 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-27 19:52:46,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:52:46,001 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-27 19:52:46,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:52:46,124 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-27 19:52:46,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 31 treesize of output 13 [2024-11-27 19:52:46,186 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-27 19:52:46,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:52:46,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-27 19:52:46,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1012 (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_1012))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1009)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 19:52:46,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449832583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:46,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:52:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-27 19:52:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614173438] [2024-11-27 19:52:46,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:52:46,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-27 19:52:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:52:46,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-27 19:52:46,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=9, NotChecked=86, Total=600 [2024-11-27 19:52:46,287 INFO L87 Difference]: Start difference. First operand 5752 states and 10414 transitions. Second operand has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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-27 19:52:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:59,235 INFO L93 Difference]: Finished difference Result 5754 states and 10418 transitions. [2024-11-27 19:52:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:52:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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-27 19:52:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:59,246 INFO L225 Difference]: With dead ends: 5754 [2024-11-27 19:52:59,246 INFO L226 Difference]: Without dead ends: 5754 [2024-11-27 19:52:59,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=547, Unknown=9, NotChecked=98, Total=756 [2024-11-27 19:52:59,247 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1875 mSDsluCounter, 19134 mSDsCounter, 0 mSdLazyCounter, 13853 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 21752 SdHoareTripleChecker+Invalid, 14368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 13853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:59,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 21752 Invalid, 14368 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 13853 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2024-11-27 19:52:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2024-11-27 19:52:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5751. [2024-11-27 19:52:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5751 states, 3459 states have (on average 1.8496675339693553) internal successors, (6398), 5739 states have internal predecessors, (6398), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:52:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 10412 transitions. [2024-11-27 19:52:59,640 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 10412 transitions. Word has length 97 [2024-11-27 19:52:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:59,640 INFO L471 AbstractCegarLoop]: Abstraction has 5751 states and 10412 transitions. [2024-11-27 19:52:59,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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-27 19:52:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 10412 transitions. [2024-11-27 19:52:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-27 19:52:59,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:59,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:52:59,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 19:52:59,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:52:59,842 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:52:59,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 859007730, now seen corresponding path program 1 times [2024-11-27 19:52:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:52:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154907424] [2024-11-27 19:52:59,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:52:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:53:01,112 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-27 19:53:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:53:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154907424] [2024-11-27 19:53:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154907424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:53:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919698545] [2024-11-27 19:53:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:53:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:53:01,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:53:01,118 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:53:01,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 19:53:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:53:01,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-27 19:53:01,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:53:01,576 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 19:53:01,576 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-27 19:53:01,583 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-27 19:53:01,615 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-27 19:53:01,627 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-27 19:53:01,728 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-27 19:53:01,733 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-27 19:53:01,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:53:01,874 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-27 19:53:01,886 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-27 19:53:01,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:53:01,980 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-27 19:53:01,990 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-27 19:53:02,008 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-27 19:53:02,012 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-27 19:53:02,017 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-27 19:53:02,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:53:02,096 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1163 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 19:53:02,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1170))) (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~mem54#1.base| v_ArrVal_1169) .cse0 v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1169) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-27 19:53:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919698545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:53:02,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:53:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-11-27 19:53:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229619812] [2024-11-27 19:53:02,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:53:02,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-27 19:53:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:53:02,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-27 19:53:02,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=499, Unknown=16, NotChecked=94, Total=702 [2024-11-27 19:53:02,253 INFO L87 Difference]: Start difference. First operand 5751 states and 10412 transitions. Second operand has 22 states, 19 states have (on average 9.68421052631579) internal successors, (184), 22 states have internal predecessors, (184), 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-27 19:53:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:53:17,270 INFO L93 Difference]: Finished difference Result 5753 states and 10416 transitions. [2024-11-27 19:53:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:53:17,271 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 9.68421052631579) internal successors, (184), 22 states have internal predecessors, (184), 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-27 19:53:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:53:17,279 INFO L225 Difference]: With dead ends: 5753 [2024-11-27 19:53:17,279 INFO L226 Difference]: Without dead ends: 5753 [2024-11-27 19:53:17,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=712, Unknown=17, NotChecked=114, Total=992 [2024-11-27 19:53:17,280 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1916 mSDsluCounter, 20732 mSDsCounter, 0 mSdLazyCounter, 12792 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 23350 SdHoareTripleChecker+Invalid, 13312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 12792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:53:17,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 23350 Invalid, 13312 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [520 Valid, 12792 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2024-11-27 19:53:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2024-11-27 19:53:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 5735. [2024-11-27 19:53:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3445 states have (on average 1.8522496371552974) internal successors, (6381), 5725 states have internal predecessors, (6381), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:53:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10393 transitions. [2024-11-27 19:53:17,744 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10393 transitions. Word has length 97 [2024-11-27 19:53:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:53:17,745 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10393 transitions. [2024-11-27 19:53:17,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 9.68421052631579) internal successors, (184), 22 states have internal predecessors, (184), 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-27 19:53:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10393 transitions. [2024-11-27 19:53:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-27 19:53:17,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:53:17,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:53:17,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 19:53:17,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:53:17,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:53:17,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:53:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2127100652, now seen corresponding path program 1 times [2024-11-27 19:53:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:53:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859860863] [2024-11-27 19:53:17,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:53:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:53:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:53:18,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-27 19:53:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:53:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859860863] [2024-11-27 19:53:18,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859860863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:53:18,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:53:18,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-27 19:53:18,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731019114] [2024-11-27 19:53:18,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:53:18,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 19:53:18,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:53:18,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 19:53:18,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:53:18,692 INFO L87 Difference]: Start difference. First operand 5735 states and 10393 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-27 19:53:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:53:26,913 INFO L93 Difference]: Finished difference Result 5760 states and 10424 transitions. [2024-11-27 19:53:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:53:26,913 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-27 19:53:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:53:26,924 INFO L225 Difference]: With dead ends: 5760 [2024-11-27 19:53:26,924 INFO L226 Difference]: Without dead ends: 5760 [2024-11-27 19:53:26,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-27 19:53:26,925 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1893 mSDsluCounter, 14322 mSDsCounter, 0 mSdLazyCounter, 9770 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 16940 SdHoareTripleChecker+Invalid, 10284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 9770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:53:26,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 16940 Invalid, 10284 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 9770 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-27 19:53:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5760 states. [2024-11-27 19:53:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5760 to 5756. [2024-11-27 19:53:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5756 states, 3465 states have (on average 1.8481962481962482) internal successors, (6404), 5744 states have internal predecessors, (6404), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:53:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5756 states to 5756 states and 10418 transitions. [2024-11-27 19:53:27,391 INFO L78 Accepts]: Start accepts. Automaton has 5756 states and 10418 transitions. Word has length 99 [2024-11-27 19:53:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:53:27,391 INFO L471 AbstractCegarLoop]: Abstraction has 5756 states and 10418 transitions. [2024-11-27 19:53:27,391 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-27 19:53:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5756 states and 10418 transitions. [2024-11-27 19:53:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-27 19:53:27,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:53:27,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:53:27,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 19:53:27,393 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:53:27,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:53:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2127100653, now seen corresponding path program 1 times [2024-11-27 19:53:27,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:53:27,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580289858] [2024-11-27 19:53:27,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:53:27,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:53:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:53:28,361 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-27 19:53:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:53:28,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580289858] [2024-11-27 19:53:28,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580289858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:53:28,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:53:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 19:53:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686546061] [2024-11-27 19:53:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:53:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:53:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:53:28,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:53:28,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:53:28,363 INFO L87 Difference]: Start difference. First operand 5756 states and 10418 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) 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-27 19:53:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:53:37,171 INFO L93 Difference]: Finished difference Result 5759 states and 10422 transitions. [2024-11-27 19:53:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:53:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) 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-27 19:53:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:53:37,181 INFO L225 Difference]: With dead ends: 5759 [2024-11-27 19:53:37,181 INFO L226 Difference]: Without dead ends: 5759 [2024-11-27 19:53:37,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-27 19:53:37,182 INFO L435 NwaCegarLoop]: 2622 mSDtfsCounter, 1885 mSDsluCounter, 13190 mSDsCounter, 0 mSdLazyCounter, 7914 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 15812 SdHoareTripleChecker+Invalid, 8426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 7914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:53:37,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 15812 Invalid, 8426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 7914 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-27 19:53:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2024-11-27 19:53:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5756. [2024-11-27 19:53:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5756 states, 3465 states have (on average 1.8476190476190477) internal successors, (6402), 5744 states have internal predecessors, (6402), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:53:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5756 states to 5756 states and 10416 transitions. [2024-11-27 19:53:37,613 INFO L78 Accepts]: Start accepts. Automaton has 5756 states and 10416 transitions. Word has length 99 [2024-11-27 19:53:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:53:37,613 INFO L471 AbstractCegarLoop]: Abstraction has 5756 states and 10416 transitions. [2024-11-27 19:53:37,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) 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-27 19:53:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5756 states and 10416 transitions. [2024-11-27 19:53:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-27 19:53:37,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:53:37,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:53:37,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 19:53:37,615 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:53:37,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:53:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1284758500, now seen corresponding path program 1 times [2024-11-27 19:53:37,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:53:37,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930349882] [2024-11-27 19:53:37,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:53:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:53:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:53:38,329 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-27 19:53:38,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:53:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930349882] [2024-11-27 19:53:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930349882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:53:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176118211] [2024-11-27 19:53:38,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:53:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:53:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:53:38,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:53:38,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 19:53:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:53:38,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-27 19:53:38,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:53:38,769 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:53:38,769 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-27 19:53:38,811 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-27 19:53:38,923 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-27 19:53:39,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:53:39,113 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-27 19:53:39,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:53:39,248 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-27 19:53:39,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:53:39,331 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-27 19:53:39,350 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-27 19:53:39,395 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-27 19:53:39,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:53:39,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1475) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-27 19:53:39,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (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_1474))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1475)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 19:53:39,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (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_1474))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1475)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 19:53:39,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (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_1478))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1474)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1475)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 19:53:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176118211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:53:39,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:53:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2024-11-27 19:53:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308218347] [2024-11-27 19:53:39,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:53:39,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 19:53:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:53:39,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 19:53:39,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=505, Unknown=12, NotChecked=196, Total=812 [2024-11-27 19:53:39,498 INFO L87 Difference]: Start difference. First operand 5756 states and 10416 transitions. Second operand has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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-27 19:53:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:53:58,099 INFO L93 Difference]: Finished difference Result 5758 states and 10420 transitions. [2024-11-27 19:53:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:53:58,099 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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-27 19:53:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:53:58,108 INFO L225 Difference]: With dead ends: 5758 [2024-11-27 19:53:58,108 INFO L226 Difference]: Without dead ends: 5758 [2024-11-27 19:53:58,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=639, Unknown=12, NotChecked=220, Total=992 [2024-11-27 19:53:58,109 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 1888 mSDsluCounter, 26044 mSDsCounter, 0 mSdLazyCounter, 18192 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 28661 SdHoareTripleChecker+Invalid, 18707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 18192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:53:58,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 28661 Invalid, 18707 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 18192 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2024-11-27 19:53:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2024-11-27 19:53:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5755. [2024-11-27 19:53:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5755 states, 3465 states have (on average 1.847041847041847) internal successors, (6400), 5743 states have internal predecessors, (6400), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:53:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 10414 transitions. [2024-11-27 19:53:58,543 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 10414 transitions. Word has length 100 [2024-11-27 19:53:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:53:58,544 INFO L471 AbstractCegarLoop]: Abstraction has 5755 states and 10414 transitions. [2024-11-27 19:53:58,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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-27 19:53:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 10414 transitions. [2024-11-27 19:53:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-27 19:53:58,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:53:58,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:53:58,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 19:53:58,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-27 19:53:58,746 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:53:58,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:53:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1284758501, now seen corresponding path program 1 times [2024-11-27 19:53:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:53:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148466186] [2024-11-27 19:53:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:53:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:53:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:53:59,794 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-27 19:53:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:53:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148466186] [2024-11-27 19:53:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148466186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:53:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659794307] [2024-11-27 19:53:59,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:53:59,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:53:59,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:53:59,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:53:59,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 19:54:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:00,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-27 19:54:00,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:54:00,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 19:54:00,226 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-27 19:54:00,232 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-27 19:54:00,275 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-27 19:54:00,279 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-27 19:54:00,391 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-27 19:54:00,396 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-27 19:54:00,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:54:00,516 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-27 19:54:00,525 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-27 19:54:00,604 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:54:00,605 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-27 19:54:00,615 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-27 19:54:00,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:54:00,687 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-27 19:54:00,697 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-27 19:54:00,717 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-27 19:54:00,722 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-27 19:54:00,744 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-27 19:54:00,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:54:00,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1643 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 19:54:00,831 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_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1643 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-27 19:54:00,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1641))) (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~mem56#1.base| v_ArrVal_1642) .cse0 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1642) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-27 19:54:01,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1649))) (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~mem54#1.base| v_ArrVal_1650) .cse0 v_ArrVal_1642) (select (select (store .cse1 .cse0 v_ArrVal_1641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1643))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1649))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1641))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1650) .cse3 v_ArrVal_1642) .cse4 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-27 19:54:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659794307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:54:01,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:54:01,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-27 19:54:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394678922] [2024-11-27 19:54:01,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:54:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-27 19:54:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:01,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-27 19:54:01,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=511, Unknown=11, NotChecked=196, Total=812 [2024-11-27 19:54:01,054 INFO L87 Difference]: Start difference. First operand 5755 states and 10414 transitions. Second operand has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 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-27 19:54:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:27,292 INFO L93 Difference]: Finished difference Result 5757 states and 10418 transitions. [2024-11-27 19:54:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:54:27,293 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 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-27 19:54:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:27,301 INFO L225 Difference]: With dead ends: 5757 [2024-11-27 19:54:27,301 INFO L226 Difference]: Without dead ends: 5757 [2024-11-27 19:54:27,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=783, Unknown=11, NotChecked=244, Total=1190 [2024-11-27 19:54:27,302 INFO L435 NwaCegarLoop]: 2620 mSDtfsCounter, 1904 mSDsluCounter, 25419 mSDsCounter, 0 mSdLazyCounter, 13953 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 28039 SdHoareTripleChecker+Invalid, 14976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 13953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:27,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 28039 Invalid, 14976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1023 Valid, 13953 Invalid, 0 Unknown, 0 Unchecked, 25.7s Time] [2024-11-27 19:54:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2024-11-27 19:54:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5733. [2024-11-27 19:54:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5733 states, 3445 states have (on average 1.851088534107402) internal successors, (6377), 5723 states have internal predecessors, (6377), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:54:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5733 states to 5733 states and 10389 transitions. [2024-11-27 19:54:27,668 INFO L78 Accepts]: Start accepts. Automaton has 5733 states and 10389 transitions. Word has length 100 [2024-11-27 19:54:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:27,668 INFO L471 AbstractCegarLoop]: Abstraction has 5733 states and 10389 transitions. [2024-11-27 19:54:27,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.894736842105263) internal successors, (131), 22 states have internal predecessors, (131), 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-27 19:54:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5733 states and 10389 transitions. [2024-11-27 19:54:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 19:54:27,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:27,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:54:27,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 19:54:27,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-27 19:54:27,870 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:54:27,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash 508698928, now seen corresponding path program 1 times [2024-11-27 19:54:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:27,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828436895] [2024-11-27 19:54:27,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:28,560 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-27 19:54:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828436895] [2024-11-27 19:54:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828436895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:28,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:28,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 19:54:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893494463] [2024-11-27 19:54:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:28,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-27 19:54:28,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:28,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 19:54:28,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-27 19:54:28,561 INFO L87 Difference]: Start difference. First operand 5733 states and 10389 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-27 19:54:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:38,136 INFO L93 Difference]: Finished difference Result 5764 states and 10426 transitions. [2024-11-27 19:54:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:54:38,137 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-27 19:54:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:38,148 INFO L225 Difference]: With dead ends: 5764 [2024-11-27 19:54:38,148 INFO L226 Difference]: Without dead ends: 5764 [2024-11-27 19:54:38,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-27 19:54:38,149 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 1888 mSDsluCounter, 18029 mSDsCounter, 0 mSdLazyCounter, 11982 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 20646 SdHoareTripleChecker+Invalid, 12495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 11982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:38,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 20646 Invalid, 12495 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 11982 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-11-27 19:54:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2024-11-27 19:54:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 5760. [2024-11-27 19:54:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5760 states, 3471 states have (on average 1.8455776433304523) internal successors, (6406), 5748 states have internal predecessors, (6406), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:54:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 10420 transitions. [2024-11-27 19:54:38,618 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 10420 transitions. Word has length 102 [2024-11-27 19:54:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:38,619 INFO L471 AbstractCegarLoop]: Abstraction has 5760 states and 10420 transitions. [2024-11-27 19:54:38,619 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-27 19:54:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 10420 transitions. [2024-11-27 19:54:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 19:54:38,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:38,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:54:38,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 19:54:38,621 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:54:38,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 508698929, now seen corresponding path program 1 times [2024-11-27 19:54:38,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:38,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619387900] [2024-11-27 19:54:38,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:38,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:39,614 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-27 19:54:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619387900] [2024-11-27 19:54:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619387900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 19:54:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064027051] [2024-11-27 19:54:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 19:54:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:39,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 19:54:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:54:39,617 INFO L87 Difference]: Start difference. First operand 5760 states and 10420 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) 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-27 19:54:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:47,375 INFO L93 Difference]: Finished difference Result 5763 states and 10424 transitions. [2024-11-27 19:54:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 19:54:47,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) 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-27 19:54:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:47,383 INFO L225 Difference]: With dead ends: 5763 [2024-11-27 19:54:47,383 INFO L226 Difference]: Without dead ends: 5763 [2024-11-27 19:54:47,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-27 19:54:47,384 INFO L435 NwaCegarLoop]: 2621 mSDtfsCounter, 1905 mSDsluCounter, 11615 mSDsCounter, 0 mSdLazyCounter, 6557 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 14236 SdHoareTripleChecker+Invalid, 7069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 6557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:47,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 14236 Invalid, 7069 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 6557 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-27 19:54:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5763 states. [2024-11-27 19:54:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5763 to 5760. [2024-11-27 19:54:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5760 states, 3471 states have (on average 1.8450014405070585) internal successors, (6404), 5748 states have internal predecessors, (6404), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:54:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 10418 transitions. [2024-11-27 19:54:47,792 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 10418 transitions. Word has length 102 [2024-11-27 19:54:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:47,793 INFO L471 AbstractCegarLoop]: Abstraction has 5760 states and 10418 transitions. [2024-11-27 19:54:47,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) 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-27 19:54:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 10418 transitions. [2024-11-27 19:54:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 19:54:47,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:47,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:54:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 19:54:47,794 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:54:47,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1787559224, now seen corresponding path program 1 times [2024-11-27 19:54:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083811655] [2024-11-27 19:54:47,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:48,564 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-27 19:54:48,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083811655] [2024-11-27 19:54:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083811655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:54:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975065390] [2024-11-27 19:54:48,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:54:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:54:48,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:54:48,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 19:54:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:48,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-27 19:54:48,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:54:49,005 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:54:49,006 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-27 19:54:49,039 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-27 19:54:49,128 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-27 19:54:49,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:54:49,293 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-27 19:54:49,394 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:54:49,394 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-27 19:54:49,458 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:54:49,458 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-27 19:54:49,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:54:49,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 42 treesize of output 41 [2024-11-27 19:54:49,556 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-27 19:54:49,611 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-27 19:54:49,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:54:49,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-27 19:54:49,632 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (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_1980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-27 19:54:49,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (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_1978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 19:54:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975065390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:54:49,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:54:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2024-11-27 19:54:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670062046] [2024-11-27 19:54:49,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:54:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-27 19:54:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 19:54:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=690, Unknown=63, NotChecked=174, Total=1056 [2024-11-27 19:54:49,942 INFO L87 Difference]: Start difference. First operand 5760 states and 10418 transitions. Second operand has 26 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 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-27 19:55:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:55:02,365 INFO L93 Difference]: Finished difference Result 5762 states and 10422 transitions. [2024-11-27 19:55:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 19:55:02,366 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 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-27 19:55:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:55:02,375 INFO L225 Difference]: With dead ends: 5762 [2024-11-27 19:55:02,375 INFO L226 Difference]: Without dead ends: 5762 [2024-11-27 19:55:02,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=849, Unknown=67, NotChecked=192, Total=1260 [2024-11-27 19:55:02,375 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1869 mSDsluCounter, 20718 mSDsCounter, 0 mSdLazyCounter, 14660 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 23334 SdHoareTripleChecker+Invalid, 15177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 14660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:55:02,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 23334 Invalid, 15177 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 14660 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2024-11-27 19:55:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2024-11-27 19:55:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5759. [2024-11-27 19:55:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5759 states, 3471 states have (on average 1.8444252376836647) internal successors, (6402), 5747 states have internal predecessors, (6402), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:55:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5759 states to 5759 states and 10416 transitions. [2024-11-27 19:55:02,785 INFO L78 Accepts]: Start accepts. Automaton has 5759 states and 10416 transitions. Word has length 103 [2024-11-27 19:55:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:55:02,785 INFO L471 AbstractCegarLoop]: Abstraction has 5759 states and 10416 transitions. [2024-11-27 19:55:02,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 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-27 19:55:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5759 states and 10416 transitions. [2024-11-27 19:55:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 19:55:02,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:55:02,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:55:02,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 19:55:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-27 19:55:02,987 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:55:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1787559225, now seen corresponding path program 1 times [2024-11-27 19:55:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:02,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929884108] [2024-11-27 19:55:02,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:04,128 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-27 19:55:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:04,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929884108] [2024-11-27 19:55:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929884108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:55:04,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272233717] [2024-11-27 19:55:04,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:04,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:04,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:04,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 19:55:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:04,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-27 19:55:04,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:04,560 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-27 19:55:04,572 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 19:55:04,572 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-27 19:55:04,584 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-27 19:55:04,591 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-27 19:55:04,657 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-27 19:55:04,660 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-27 19:55:04,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:04,773 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-27 19:55:04,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-27 19:55:04,881 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:04,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 62 treesize of output 57 [2024-11-27 19:55:04,891 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-27 19:55:04,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:04,977 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-27 19:55:04,987 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-27 19:55:05,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:05,064 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-27 19:55:05,072 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-27 19:55:05,088 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-27 19:55:05,093 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-27 19:55:05,098 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-27 19:55:05,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:55:05,164 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2163 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-27 19:55:05,184 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_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2163 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-27 19:55:05,212 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2161))) (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_2160) .cse0 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2160) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-27 19:55:05,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2159))) (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~mem56#1.base| v_ArrVal_2158) .cse0 v_ArrVal_2160) (select (select (store .cse1 .cse0 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2163))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2159))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2161))) (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~mem56#1.base| v_ArrVal_2158) .cse3 v_ArrVal_2160) .cse4 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-27 19:55:05,395 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 (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2159))) (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_2158) .cse1 v_ArrVal_2160) (select (select (store .cse2 .cse1 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2163))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2159))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2161))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2158) .cse4 v_ArrVal_2160) .cse5 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-27 19:55:05,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2169))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2159))) (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_2168) .cse0 v_ArrVal_2158) .cse1 v_ArrVal_2160) (select (select (store .cse2 .cse1 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2163))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2169))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2159))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2161))) (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_2168) .cse5 v_ArrVal_2158) .cse6 v_ArrVal_2160) .cse7 v_ArrVal_2163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-27 19:55:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272233717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:55:05,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:55:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2024-11-27 19:55:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811984644] [2024-11-27 19:55:05,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:55:05,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-27 19:55:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:05,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-27 19:55:05,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=461, Unknown=12, NotChecked=294, Total=870 [2024-11-27 19:55:05,516 INFO L87 Difference]: Start difference. First operand 5759 states and 10416 transitions. Second operand has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 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-27 19:55:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:55:14,973 INFO L93 Difference]: Finished difference Result 5761 states and 10420 transitions. [2024-11-27 19:55:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:55:14,974 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 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-27 19:55:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:55:14,983 INFO L225 Difference]: With dead ends: 5761 [2024-11-27 19:55:14,984 INFO L226 Difference]: Without dead ends: 5761 [2024-11-27 19:55:14,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=778, Unknown=12, NotChecked=378, Total=1332 [2024-11-27 19:55:14,985 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1900 mSDsluCounter, 13202 mSDsCounter, 0 mSdLazyCounter, 7908 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 15821 SdHoareTripleChecker+Invalid, 8930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 7908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:55:14,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 15821 Invalid, 8930 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 7908 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-27 19:55:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5761 states. [2024-11-27 19:55:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5761 to 5731. [2024-11-27 19:55:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 3445 states have (on average 1.8499274310595066) internal successors, (6373), 5721 states have internal predecessors, (6373), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:55:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 10385 transitions. [2024-11-27 19:55:15,465 INFO L78 Accepts]: Start accepts. Automaton has 5731 states and 10385 transitions. Word has length 103 [2024-11-27 19:55:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:55:15,465 INFO L471 AbstractCegarLoop]: Abstraction has 5731 states and 10385 transitions. [2024-11-27 19:55:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 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-27 19:55:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5731 states and 10385 transitions. [2024-11-27 19:55:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 19:55:15,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:55:15,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:55:15,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 19:55:15,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-27 19:55:15,667 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:55:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2050602354, now seen corresponding path program 1 times [2024-11-27 19:55:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:15,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448399929] [2024-11-27 19:55:15,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:16,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-27 19:55:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448399929] [2024-11-27 19:55:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448399929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 19:55:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507953423] [2024-11-27 19:55:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-27 19:55:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:16,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 19:55:16,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-27 19:55:16,424 INFO L87 Difference]: Start difference. First operand 5731 states and 10385 transitions. Second operand has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 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-27 19:55:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:55:29,916 INFO L93 Difference]: Finished difference Result 5770 states and 10430 transitions. [2024-11-27 19:55:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:55:29,917 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 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-27 19:55:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:55:29,926 INFO L225 Difference]: With dead ends: 5770 [2024-11-27 19:55:29,926 INFO L226 Difference]: Without dead ends: 5770 [2024-11-27 19:55:29,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-27 19:55:29,927 INFO L435 NwaCegarLoop]: 2615 mSDtfsCounter, 1891 mSDsluCounter, 16485 mSDsCounter, 0 mSdLazyCounter, 14003 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 19100 SdHoareTripleChecker+Invalid, 14520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 14003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:55:29,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 19100 Invalid, 14520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 14003 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2024-11-27 19:55:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2024-11-27 19:55:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5766. [2024-11-27 19:55:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5766 states, 3479 states have (on average 1.8424834722621444) internal successors, (6410), 5754 states have internal predecessors, (6410), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:55:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 10424 transitions. [2024-11-27 19:55:30,347 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 10424 transitions. Word has length 106 [2024-11-27 19:55:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:55:30,347 INFO L471 AbstractCegarLoop]: Abstraction has 5766 states and 10424 transitions. [2024-11-27 19:55:30,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 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-27 19:55:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 10424 transitions. [2024-11-27 19:55:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 19:55:30,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:55:30,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:55:30,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 19:55:30,348 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:55:30,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2050602355, now seen corresponding path program 1 times [2024-11-27 19:55:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263787550] [2024-11-27 19:55:30,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:31,509 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-27 19:55:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263787550] [2024-11-27 19:55:31,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263787550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:55:31,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:55:31,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-27 19:55:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986333456] [2024-11-27 19:55:31,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:55:31,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 19:55:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:31,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 19:55:31,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-27 19:55:31,511 INFO L87 Difference]: Start difference. First operand 5766 states and 10424 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-27 19:55:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:55:51,346 INFO L93 Difference]: Finished difference Result 5769 states and 10428 transitions. [2024-11-27 19:55:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 19:55:51,346 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-27 19:55:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:55:51,354 INFO L225 Difference]: With dead ends: 5769 [2024-11-27 19:55:51,354 INFO L226 Difference]: Without dead ends: 5769 [2024-11-27 19:55:51,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-27 19:55:51,355 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 1887 mSDsluCounter, 20029 mSDsCounter, 0 mSdLazyCounter, 16400 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 22646 SdHoareTripleChecker+Invalid, 16916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 16400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:55:51,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 22646 Invalid, 16916 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 16400 Invalid, 0 Unknown, 0 Unchecked, 19.3s Time] [2024-11-27 19:55:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2024-11-27 19:55:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5766. [2024-11-27 19:55:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5766 states, 3479 states have (on average 1.841908594423685) internal successors, (6408), 5754 states have internal predecessors, (6408), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:55:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 10422 transitions. [2024-11-27 19:55:51,824 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 10422 transitions. Word has length 106 [2024-11-27 19:55:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:55:51,824 INFO L471 AbstractCegarLoop]: Abstraction has 5766 states and 10422 transitions. [2024-11-27 19:55:51,824 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-27 19:55:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 10422 transitions. [2024-11-27 19:55:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:55:51,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:55:51,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:55:51,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 19:55:51,825 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:55:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:55:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 513166714, now seen corresponding path program 1 times [2024-11-27 19:55:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:55:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489009185] [2024-11-27 19:55:51,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:55:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:52,670 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-27 19:55:52,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:55:52,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489009185] [2024-11-27 19:55:52,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489009185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:55:52,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134787643] [2024-11-27 19:55:52,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:55:52,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:55:52,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:55:52,673 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:55:52,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 19:55:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:55:53,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-27 19:55:53,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:55:53,120 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:55:53,121 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-27 19:55:53,162 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-27 19:55:53,264 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-27 19:55:53,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:53,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 19:55:53,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:53,559 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-27 19:55:53,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:53,656 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-27 19:55:53,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:53,740 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-27 19:55:53,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:55:53,819 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-27 19:55:53,836 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-27 19:55:53,928 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-27 19:55:53,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-27 19:55:53,936 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-27 19:55:53,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:55:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134787643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:55:54,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:55:54,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-11-27 19:55:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349600366] [2024-11-27 19:55:54,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:55:54,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-27 19:55:54,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:55:54,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-27 19:55:54,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1160, Unknown=55, NotChecked=0, Total=1406 [2024-11-27 19:55:54,888 INFO L87 Difference]: Start difference. First operand 5766 states and 10422 transitions. Second operand has 27 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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-27 19:56:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:11,338 INFO L93 Difference]: Finished difference Result 5768 states and 10426 transitions. [2024-11-27 19:56:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 19:56:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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-27 19:56:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:11,346 INFO L225 Difference]: With dead ends: 5768 [2024-11-27 19:56:11,346 INFO L226 Difference]: Without dead ends: 5768 [2024-11-27 19:56:11,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=217, Invalid=1368, Unknown=55, NotChecked=0, Total=1640 [2024-11-27 19:56:11,347 INFO L435 NwaCegarLoop]: 2615 mSDtfsCounter, 1858 mSDsluCounter, 19730 mSDsCounter, 0 mSdLazyCounter, 16225 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 22345 SdHoareTripleChecker+Invalid, 16742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 16225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:11,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2362 Valid, 22345 Invalid, 16742 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 16225 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2024-11-27 19:56:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2024-11-27 19:56:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 5765. [2024-11-27 19:56:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5765 states, 3479 states have (on average 1.8413337165852257) internal successors, (6406), 5753 states have internal predecessors, (6406), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 19:56:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 10420 transitions. [2024-11-27 19:56:11,739 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 10420 transitions. Word has length 107 [2024-11-27 19:56:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:11,740 INFO L471 AbstractCegarLoop]: Abstraction has 5765 states and 10420 transitions. [2024-11-27 19:56:11,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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-27 19:56:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 10420 transitions. [2024-11-27 19:56:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:56:11,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:11,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:56:11,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 19:56:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:11,941 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:56:11,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 513166715, now seen corresponding path program 1 times [2024-11-27 19:56:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282458061] [2024-11-27 19:56:11,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:13,078 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-27 19:56:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282458061] [2024-11-27 19:56:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282458061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219104672] [2024-11-27 19:56:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:13,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:13,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:13,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 19:56:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:13,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-27 19:56:13,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:13,555 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-27 19:56:13,575 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:56:13,575 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-27 19:56:13,645 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-27 19:56:13,654 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-27 19:56:13,818 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-27 19:56:13,823 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-27 19:56:14,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:56:14,017 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-27 19:56:14,030 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-27 19:56:14,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:56:14,160 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-27 19:56:14,172 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-27 19:56:14,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:56:14,267 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-27 19:56:14,275 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-27 19:56:14,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:56:14,370 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-27 19:56:14,377 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-27 19:56:14,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 19:56:14,481 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-27 19:56:14,487 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-27 19:56:14,516 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-27 19:56:14,521 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-27 19:56:14,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:14,577 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-27 19:56:14,593 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-27 19:56:14,593 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-27 19:56:14,628 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-27 19:56:14,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:15,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2732) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (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_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (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_2736 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2733))) (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~mem58#1.base| v_ArrVal_2732) .cse1 v_ArrVal_2735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2736) (select (select (store .cse2 .cse1 v_ArrVal_2734) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-27 19:56:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219104672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:31,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:56:31,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2024-11-27 19:56:31,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60235513] [2024-11-27 19:56:31,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:31,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-27 19:56:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:31,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-27 19:56:31,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1408, Unknown=55, NotChecked=78, Total=1722 [2024-11-27 19:56:31,286 INFO L87 Difference]: Start difference. First operand 5765 states and 10420 transitions. Second operand has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 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-27 19:59:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:59:10,970 INFO L93 Difference]: Finished difference Result 5767 states and 10424 transitions. [2024-11-27 19:59:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 19:59:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 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-27 19:59:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:59:10,979 INFO L225 Difference]: With dead ends: 5767 [2024-11-27 19:59:10,979 INFO L226 Difference]: Without dead ends: 5767 [2024-11-27 19:59:10,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=308, Invalid=2191, Unknown=55, NotChecked=98, Total=2652 [2024-11-27 19:59:10,980 INFO L435 NwaCegarLoop]: 2615 mSDtfsCounter, 1867 mSDsluCounter, 28847 mSDsCounter, 0 mSdLazyCounter, 23647 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 152.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 31462 SdHoareTripleChecker+Invalid, 24170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 23647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 156.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:59:10,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 31462 Invalid, 24170 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [523 Valid, 23647 Invalid, 0 Unknown, 0 Unchecked, 156.5s Time] [2024-11-27 19:59:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2024-11-27 19:59:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5729. [2024-11-27 19:59:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 3445 states have (on average 1.8487663280116111) internal successors, (6369), 5719 states have internal predecessors, (6369), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-27 19:59:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 10381 transitions. [2024-11-27 19:59:11,349 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 10381 transitions. Word has length 107 [2024-11-27 19:59:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:59:11,350 INFO L471 AbstractCegarLoop]: Abstraction has 5729 states and 10381 transitions. [2024-11-27 19:59:11,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 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-27 19:59:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 10381 transitions. [2024-11-27 19:59:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-27 19:59:11,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:59:11,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:59:11,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 19:59:11,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:59:11,551 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 19:59:11,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:59:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2119415015, now seen corresponding path program 1 times [2024-11-27 19:59:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:59:11,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333871482] [2024-11-27 19:59:11,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:59:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:59:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:59:13,393 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-27 19:59:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:59:13,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333871482] [2024-11-27 19:59:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333871482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:59:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:59:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-27 19:59:13,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563080531] [2024-11-27 19:59:13,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:59:13,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 19:59:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:59:13,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 19:59:13,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:59:13,395 INFO L87 Difference]: Start difference. First operand 5729 states and 10381 transitions. Second operand has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 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-27 20:00:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:00:23,236 INFO L93 Difference]: Finished difference Result 5774 states and 10432 transitions. [2024-11-27 20:00:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:00:23,237 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 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-27 20:00:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:00:23,246 INFO L225 Difference]: With dead ends: 5774 [2024-11-27 20:00:23,246 INFO L226 Difference]: Without dead ends: 5774 [2024-11-27 20:00:23,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-27 20:00:23,247 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1917 mSDsluCounter, 21135 mSDsCounter, 0 mSdLazyCounter, 11236 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 23753 SdHoareTripleChecker+Invalid, 11754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 11236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:00:23,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2421 Valid, 23753 Invalid, 11754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [518 Valid, 11236 Invalid, 0 Unknown, 0 Unchecked, 68.6s Time] [2024-11-27 20:00:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2024-11-27 20:00:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5770. [2024-11-27 20:00:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 3485 states have (on average 1.8398852223816355) internal successors, (6412), 5758 states have internal predecessors, (6412), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 20:00:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 10426 transitions. [2024-11-27 20:00:23,661 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 10426 transitions. Word has length 109 [2024-11-27 20:00:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:00:23,661 INFO L471 AbstractCegarLoop]: Abstraction has 5770 states and 10426 transitions. [2024-11-27 20:00:23,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 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-27 20:00:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 10426 transitions. [2024-11-27 20:00:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-27 20:00:23,662 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:00:23,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:00:23,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-27 20:00:23,662 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:00:23,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:00:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2119415014, now seen corresponding path program 1 times [2024-11-27 20:00:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:00:23,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503665009] [2024-11-27 20:00:23,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:00:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:00:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:00:27,299 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-27 20:00:27,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:00:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503665009] [2024-11-27 20:00:27,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503665009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:00:27,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:00:27,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-27 20:00:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957394046] [2024-11-27 20:00:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:00:27,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 20:00:27,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:00:27,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 20:00:27,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-27 20:00:27,301 INFO L87 Difference]: Start difference. First operand 5770 states and 10426 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 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-27 20:01:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:01:52,227 INFO L93 Difference]: Finished difference Result 5773 states and 10430 transitions. [2024-11-27 20:01:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:01:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 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-27 20:01:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:01:52,237 INFO L225 Difference]: With dead ends: 5773 [2024-11-27 20:01:52,237 INFO L226 Difference]: Without dead ends: 5773 [2024-11-27 20:01:52,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-27 20:01:52,238 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1890 mSDsluCounter, 17117 mSDsCounter, 0 mSdLazyCounter, 12895 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 19733 SdHoareTripleChecker+Invalid, 13412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 12895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:01:52,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 19733 Invalid, 13412 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [517 Valid, 12895 Invalid, 0 Unknown, 0 Unchecked, 83.0s Time] [2024-11-27 20:01:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2024-11-27 20:01:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5770. [2024-11-27 20:01:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 3485 states have (on average 1.8393113342898135) internal successors, (6410), 5758 states have internal predecessors, (6410), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 20:01:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 10424 transitions. [2024-11-27 20:01:52,680 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 10424 transitions. Word has length 109 [2024-11-27 20:01:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:01:52,680 INFO L471 AbstractCegarLoop]: Abstraction has 5770 states and 10424 transitions. [2024-11-27 20:01:52,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 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-27 20:01:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 10424 transitions. [2024-11-27 20:01:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 20:01:52,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:01:52,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:01:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-27 20:01:52,681 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:01:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:01:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1961645585, now seen corresponding path program 1 times [2024-11-27 20:01:52,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:01:52,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969721731] [2024-11-27 20:01:52,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:01:52,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:01:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:01:53,438 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-27 20:01:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:01:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969721731] [2024-11-27 20:01:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969721731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:01:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:01:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:01:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436545828] [2024-11-27 20:01:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:01:53,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:01:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:01:53,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:01:53,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:01:53,439 INFO L87 Difference]: Start difference. First operand 5770 states and 10424 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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-27 20:01:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:01:58,377 INFO L93 Difference]: Finished difference Result 5769 states and 10422 transitions. [2024-11-27 20:01:58,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:01:58,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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 110 [2024-11-27 20:01:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:01:58,389 INFO L225 Difference]: With dead ends: 5769 [2024-11-27 20:01:58,389 INFO L226 Difference]: Without dead ends: 5769 [2024-11-27 20:01:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:01:58,390 INFO L435 NwaCegarLoop]: 2954 mSDtfsCounter, 2 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11025 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:01:58,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11025 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-27 20:01:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2024-11-27 20:01:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5769. [2024-11-27 20:01:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5769 states, 3485 states have (on average 1.8387374461979913) internal successors, (6408), 5757 states have internal predecessors, (6408), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-27 20:01:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 10422 transitions. [2024-11-27 20:01:58,815 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 10422 transitions. Word has length 110 [2024-11-27 20:01:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:01:58,815 INFO L471 AbstractCegarLoop]: Abstraction has 5769 states and 10422 transitions. [2024-11-27 20:01:58,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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-27 20:01:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 10422 transitions. [2024-11-27 20:01:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 20:01:58,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:01:58,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:01:58,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-27 20:01:58,816 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:01:58,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:01:58,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1961645586, now seen corresponding path program 1 times [2024-11-27 20:01:58,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:01:58,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976191017] [2024-11-27 20:01:58,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:01:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:01:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:02:02,803 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-27 20:02:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:02:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976191017] [2024-11-27 20:02:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976191017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:02:02,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198438744] [2024-11-27 20:02:02,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:02:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:02:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:02:02,806 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:02:02,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_883c4869-b7d1-4b9c-a21a-653c6ba999a4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:02:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:02:03,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-27 20:02:03,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:02:04,032 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:02:04,032 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-27 20:02:04,095 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-27 20:02:04,317 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-27 20:02:04,380 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-27 20:02:05,149 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-27 20:02:05,170 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-27 20:02:06,436 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:02:06,437 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-27 20:02:06,452 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-27 20:02:07,137 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:02:07,137 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-27 20:02:07,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-27 20:02:07,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:02:07,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 73 treesize of output 66 [2024-11-27 20:02:07,732 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-27 20:02:08,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:02:08,263 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-27 20:02:08,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-27 20:02:08,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:02:08,879 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-27 20:02:08,894 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-27 20:02:09,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:02:09,441 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-27 20:02:09,561 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-27 20:02:09,561 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-27 20:02:09,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:02:09,897 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-27 20:02:09,936 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-27 20:02:10,169 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-27 20:02:10,182 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-27 20:02:10,195 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-27 20:02:10,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:02:10,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:02:12,801 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_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3232))) (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~mem58#1.base| v_ArrVal_3233) .cse0 v_ArrVal_3234) (select (select (store .cse1 .cse0 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3238))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 40)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3232))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_3235))) (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~mem58#1.base| v_ArrVal_3233) .cse3 v_ArrVal_3234) .cse4 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse5 .cse4 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-27 20:02:12,892 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_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3232))) (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_3233) .cse1 v_ArrVal_3234) (select (select (store .cse2 .cse1 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3238))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3232))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3235))) (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_3233) .cse4 v_ArrVal_3234) .cse5 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse6 .cse5 v_ArrVal_3237) |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-27 20:02:13,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3230))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3232))) (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~mem57#1.base| v_ArrVal_3231) .cse0 v_ArrVal_3233) .cse1 v_ArrVal_3234) (select (select (store .cse2 .cse1 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3238))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (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_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3230))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3232))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3235))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3231) .cse5 v_ArrVal_3233) .cse6 v_ArrVal_3234) .cse7 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse8 .cse7 v_ArrVal_3237) |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-27 20:02:13,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (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_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3230))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3232))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3231) .cse1 v_ArrVal_3233) .cse2 v_ArrVal_3234) (select (select (store .cse3 .cse2 v_ArrVal_3235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3238))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3234 (Array Int Int)) (v_ArrVal_3235 (Array Int Int))) (or (forall ((v_ArrVal_3236 Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3230))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3232))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3235))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3231) .cse6 v_ArrVal_3233) .cse7 v_ArrVal_3234) .cse8 v_ArrVal_3238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3236) (select (select (store .cse9 .cse8 v_ArrVal_3237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-27 20:02:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198438744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:02:45,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:02:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2024-11-27 20:02:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698610287] [2024-11-27 20:02:45,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:02:45,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-27 20:02:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:02:45,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-27 20:02:45,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1397, Unknown=35, NotChecked=410, Total=2070 [2024-11-27 20:02:45,646 INFO L87 Difference]: Start difference. First operand 5769 states and 10422 transitions. Second operand has 32 states, 29 states have (on average 5.172413793103448) internal successors, (150), 31 states have internal predecessors, (150), 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)