./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-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_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/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_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/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_14fb7c73-cfce-4e06-b820-dabb14a5e520/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 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:03:02,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:03:03,004 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:03:03,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:03:03,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:03:03,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:03:03,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:03:03,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:03:03,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:03:03,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:03:03,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:03:03,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:03:03,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:03:03,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:03:03,045 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:03:03,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:03:03,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:03:03,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:03:03,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:03:03,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:03:03,047 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:03:03,047 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:03:03,047 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:03:03,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:03:03,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:03:03,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:03:03,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:03:03,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:03:03,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:03:03,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:03:03,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:03:03,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:03:03,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:03:03,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:03,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:03:03,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:03:03,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:03:03,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:03:03,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:03,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:03:03,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:03:03,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:03:03,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:03:03,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:03:03,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:03:03,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:03:03,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:03:03,053 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_14fb7c73-cfce-4e06-b820-dabb14a5e520/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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2024-11-28 03:03:03,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:03:03,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:03:03,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:03:03,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:03:03,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:03:03,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-28 03:03:06,536 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/data/7e46b61b6/c2b58436155049d99af2accef4463940/FLAG408a76486 [2024-11-28 03:03:06,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:03:06,968 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-28 03:03:06,998 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/data/7e46b61b6/c2b58436155049d99af2accef4463940/FLAG408a76486 [2024-11-28 03:03:07,021 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/data/7e46b61b6/c2b58436155049d99af2accef4463940 [2024-11-28 03:03:07,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:03:07,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:03:07,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:03:07,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:03:07,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:03:07,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:07,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0a7f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07, skipping insertion in model container [2024-11-28 03:03:07,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:07,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:03:07,674 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,718 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,726 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,733 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,741 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,778 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,778 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,781 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,782 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:03:07,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:03:07,801 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:03:07,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:03:07,971 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:03:07,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07 WrapperNode [2024-11-28 03:03:07,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:03:07,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:03:07,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:03:07,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:03:07,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,095 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-28 03:03:08,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:03:08,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:03:08,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:03:08,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:03:08,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,216 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-28 03:03:08,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:03:08,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:03:08,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:03:08,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:03:08,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (1/1) ... [2024-11-28 03:03:08,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:08,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:03:08,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:03:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 03:03:08,417 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 03:03:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 03:03:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 03:03:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 03:03:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 03:03:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 03:03:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 03:03:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:03:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:03:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:03:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:03:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:03:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:03:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:03:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:03:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 03:03:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 03:03:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:03:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:03:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:03:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:03:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:03:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:03:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:03:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:03:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:03:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:03:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:03:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:03:08,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:03:08,699 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:03:08,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:03:08,726 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:03:08,751 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:03:08,789 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:03:11,710 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-28 03:03:11,710 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:03:11,759 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:03:11,759 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-28 03:03:11,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:11 BoogieIcfgContainer [2024-11-28 03:03:11,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:03:11,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:03:11,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:03:11,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:03:11,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:03:07" (1/3) ... [2024-11-28 03:03:11,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e18fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:03:11, skipping insertion in model container [2024-11-28 03:03:11,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:07" (2/3) ... [2024-11-28 03:03:11,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4e18fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:03:11, skipping insertion in model container [2024-11-28 03:03:11,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:11" (3/3) ... [2024-11-28 03:03:11,783 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2024-11-28 03:03:11,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:03:11,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test2-1.i that has 6 procedures, 1087 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2024-11-28 03:03:11,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:03:11,912 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;@35e6ee79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:03:11,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-28 03:03:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 1077 states, 642 states have (on average 2.0109034267912773) internal successors, (1291), 1070 states have internal predecessors, (1291), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-28 03:03:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:03:11,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:11,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:03:11,932 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-28 03:03:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-28 03:03:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680108523] [2024-11-28 03:03:11,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680108523] [2024-11-28 03:03:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680108523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:12,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:12,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:03:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127493589] [2024-11-28 03:03:12,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:12,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:12,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:12,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:12,278 INFO L87 Difference]: Start difference. First operand has 1077 states, 642 states have (on average 2.0109034267912773) internal successors, (1291), 1070 states have internal predecessors, (1291), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:13,367 INFO L93 Difference]: Finished difference Result 1063 states and 1237 transitions. [2024-11-28 03:03:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:13,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 03:03:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:13,401 INFO L225 Difference]: With dead ends: 1063 [2024-11-28 03:03:13,402 INFO L226 Difference]: Without dead ends: 1061 [2024-11-28 03:03:13,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:13,407 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 1102 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:13,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 900 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:03:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-28 03:03:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2024-11-28 03:03:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 644 states have (on average 1.889751552795031) internal successors, (1217), 1054 states have internal predecessors, (1217), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-28 03:03:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1235 transitions. [2024-11-28 03:03:13,562 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1235 transitions. Word has length 3 [2024-11-28 03:03:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:13,565 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1235 transitions. [2024-11-28 03:03:13,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1235 transitions. [2024-11-28 03:03:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:03:13,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:13,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:03:13,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:03:13,567 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-28 03:03:13,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-28 03:03:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:13,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835927967] [2024-11-28 03:03:13,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835927967] [2024-11-28 03:03:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835927967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:03:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997834944] [2024-11-28 03:03:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:13,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:13,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:13,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:13,734 INFO L87 Difference]: Start difference. First operand 1061 states and 1235 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:15,221 INFO L93 Difference]: Finished difference Result 1836 states and 2172 transitions. [2024-11-28 03:03:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 03:03:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:15,229 INFO L225 Difference]: With dead ends: 1836 [2024-11-28 03:03:15,229 INFO L226 Difference]: Without dead ends: 1836 [2024-11-28 03:03:15,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:15,230 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 919 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:15,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1746 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 03:03:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-28 03:03:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1572. [2024-11-28 03:03:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1151 states have (on average 1.8505647263249347) internal successors, (2130), 1563 states have internal predecessors, (2130), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2162 transitions. [2024-11-28 03:03:15,290 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2162 transitions. Word has length 3 [2024-11-28 03:03:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:15,290 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2162 transitions. [2024-11-28 03:03:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2162 transitions. [2024-11-28 03:03:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:03:15,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:15,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:15,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:03:15,292 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-28 03:03:15,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2024-11-28 03:03:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646608745] [2024-11-28 03:03:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646608745] [2024-11-28 03:03:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646608745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:15,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:03:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211707015] [2024-11-28 03:03:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:15,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:15,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:15,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:15,419 INFO L87 Difference]: Start difference. First operand 1572 states and 2162 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-28 03:03:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:16,250 INFO L93 Difference]: Finished difference Result 1846 states and 2500 transitions. [2024-11-28 03:03:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:16,250 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-28 03:03:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:16,259 INFO L225 Difference]: With dead ends: 1846 [2024-11-28 03:03:16,260 INFO L226 Difference]: Without dead ends: 1846 [2024-11-28 03:03:16,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:16,264 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 1087 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:16,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1504 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:03:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-28 03:03:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1525. [2024-11-28 03:03:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1151 states have (on average 1.788879235447437) internal successors, (2059), 1516 states have internal predecessors, (2059), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2091 transitions. [2024-11-28 03:03:16,326 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2091 transitions. Word has length 9 [2024-11-28 03:03:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:16,327 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2091 transitions. [2024-11-28 03:03:16,327 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-28 03:03:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2091 transitions. [2024-11-28 03:03:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 03:03:16,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:16,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:16,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:03:16,328 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-28 03:03:16,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2024-11-28 03:03:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:16,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866279497] [2024-11-28 03:03:16,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:16,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866279497] [2024-11-28 03:03:16,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866279497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:16,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:16,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:03:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612325153] [2024-11-28 03:03:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:16,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:16,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:16,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:16,529 INFO L87 Difference]: Start difference. First operand 1525 states and 2091 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-28 03:03:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:17,392 INFO L93 Difference]: Finished difference Result 2067 states and 2869 transitions. [2024-11-28 03:03:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:17,393 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-28 03:03:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:17,403 INFO L225 Difference]: With dead ends: 2067 [2024-11-28 03:03:17,403 INFO L226 Difference]: Without dead ends: 2067 [2024-11-28 03:03:17,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:17,405 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 879 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:17,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1754 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:03:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2024-11-28 03:03:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1500. [2024-11-28 03:03:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1151 states have (on average 1.7463075586446568) internal successors, (2010), 1491 states have internal predecessors, (2010), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2042 transitions. [2024-11-28 03:03:17,448 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2042 transitions. Word has length 9 [2024-11-28 03:03:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:17,449 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 2042 transitions. [2024-11-28 03:03:17,449 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-28 03:03:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2042 transitions. [2024-11-28 03:03:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:03:17,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:17,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:17,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:03:17,450 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-28 03:03:17,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1246154765, now seen corresponding path program 1 times [2024-11-28 03:03:17,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:17,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302147882] [2024-11-28 03:03:17,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302147882] [2024-11-28 03:03:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302147882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:17,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:03:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970085754] [2024-11-28 03:03:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:03:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:17,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:03:17,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:03:17,555 INFO L87 Difference]: Start difference. First operand 1500 states and 2042 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-28 03:03:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:17,789 INFO L93 Difference]: Finished difference Result 2685 states and 3581 transitions. [2024-11-28 03:03:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:03:17,790 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-28 03:03:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:17,801 INFO L225 Difference]: With dead ends: 2685 [2024-11-28 03:03:17,803 INFO L226 Difference]: Without dead ends: 2685 [2024-11-28 03:03:17,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:17,803 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 1101 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:17,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 3311 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:03:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-11-28 03:03:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 1502. [2024-11-28 03:03:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1153 states have (on average 1.7450130095403296) internal successors, (2012), 1493 states have internal predecessors, (2012), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2044 transitions. [2024-11-28 03:03:17,851 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2044 transitions. Word has length 10 [2024-11-28 03:03:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:17,851 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2044 transitions. [2024-11-28 03:03:17,851 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-28 03:03:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2044 transitions. [2024-11-28 03:03:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:03:17,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:17,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:17,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:03:17,852 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-28 03:03:17,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash 495195041, now seen corresponding path program 1 times [2024-11-28 03:03:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:17,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940716193] [2024-11-28 03:03:17,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:17,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:17,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940716193] [2024-11-28 03:03:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940716193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:17,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:17,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:03:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753105000] [2024-11-28 03:03:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:17,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:03:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:17,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:03:17,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:03:17,986 INFO L87 Difference]: Start difference. First operand 1502 states and 2044 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-28 03:03:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:18,879 INFO L93 Difference]: Finished difference Result 1578 states and 2151 transitions. [2024-11-28 03:03:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:03:18,880 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-28 03:03:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:18,885 INFO L225 Difference]: With dead ends: 1578 [2024-11-28 03:03:18,885 INFO L226 Difference]: Without dead ends: 1578 [2024-11-28 03:03:18,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:18,886 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1352 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:18,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1363 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:03:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-28 03:03:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1479. [2024-11-28 03:03:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1153 states have (on average 1.705117085862966) internal successors, (1966), 1470 states have internal predecessors, (1966), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1998 transitions. [2024-11-28 03:03:18,920 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1998 transitions. Word has length 19 [2024-11-28 03:03:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:18,922 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1998 transitions. [2024-11-28 03:03:18,922 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-28 03:03:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1998 transitions. [2024-11-28 03:03:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:03:18,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:18,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:18,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:03:18,923 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-28 03:03:18,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 495195042, now seen corresponding path program 1 times [2024-11-28 03:03:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:18,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912592661] [2024-11-28 03:03:18,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:18,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:19,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:19,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912592661] [2024-11-28 03:03:19,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912592661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:19,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:19,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:03:19,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451614244] [2024-11-28 03:03:19,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:19,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:19,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:19,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:19,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:19,029 INFO L87 Difference]: Start difference. First operand 1479 states and 1998 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-28 03:03:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:19,061 INFO L93 Difference]: Finished difference Result 1341 states and 1792 transitions. [2024-11-28 03:03:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:19,062 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-28 03:03:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:19,066 INFO L225 Difference]: With dead ends: 1341 [2024-11-28 03:03:19,066 INFO L226 Difference]: Without dead ends: 1341 [2024-11-28 03:03:19,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:19,067 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 61 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1977 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-28 03:03:19,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1977 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:03:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-28 03:03:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2024-11-28 03:03:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1027 states have (on average 1.7137293086660175) internal successors, (1760), 1332 states have internal predecessors, (1760), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1792 transitions. [2024-11-28 03:03:19,097 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1792 transitions. Word has length 19 [2024-11-28 03:03:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:19,097 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1792 transitions. [2024-11-28 03:03:19,097 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-28 03:03:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1792 transitions. [2024-11-28 03:03:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 03:03:19,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:19,098 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-28 03:03:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:03:19,098 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-28 03:03:19,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash -858657125, now seen corresponding path program 1 times [2024-11-28 03:03:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043676028] [2024-11-28 03:03:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:19,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043676028] [2024-11-28 03:03:19,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043676028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:19,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:19,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:03:19,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626256662] [2024-11-28 03:03:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:19,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:03:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:19,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:03:19,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:03:19,182 INFO L87 Difference]: Start difference. First operand 1341 states and 1792 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-28 03:03:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:19,257 INFO L93 Difference]: Finished difference Result 1312 states and 1742 transitions. [2024-11-28 03:03:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:03:19,260 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-28 03:03:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:19,264 INFO L225 Difference]: With dead ends: 1312 [2024-11-28 03:03:19,265 INFO L226 Difference]: Without dead ends: 1312 [2024-11-28 03:03:19,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:19,265 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 41 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2912 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-28 03:03:19,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2912 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:03:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-28 03:03:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2024-11-28 03:03:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 999 states have (on average 1.7057057057057057) internal successors, (1704), 1297 states have internal predecessors, (1704), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1736 transitions. [2024-11-28 03:03:19,295 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1736 transitions. Word has length 21 [2024-11-28 03:03:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:19,295 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1736 transitions. [2024-11-28 03:03:19,295 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-28 03:03:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1736 transitions. [2024-11-28 03:03:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:03:19,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:19,296 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-28 03:03:19,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:03:19,297 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-28 03:03:19,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash -496287351, now seen corresponding path program 1 times [2024-11-28 03:03:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414805314] [2024-11-28 03:03:19,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414805314] [2024-11-28 03:03:19,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414805314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:19,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:03:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272494950] [2024-11-28 03:03:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:19,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:03:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:19,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:03:19,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:03:19,535 INFO L87 Difference]: Start difference. First operand 1306 states and 1736 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-28 03:03:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:20,555 INFO L93 Difference]: Finished difference Result 2102 states and 2887 transitions. [2024-11-28 03:03:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:03:20,556 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-28 03:03:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:20,564 INFO L225 Difference]: With dead ends: 2102 [2024-11-28 03:03:20,564 INFO L226 Difference]: Without dead ends: 2102 [2024-11-28 03:03:20,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:20,566 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 828 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:20,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1926 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:03:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2024-11-28 03:03:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1302. [2024-11-28 03:03:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 999 states have (on average 1.6976976976976976) internal successors, (1696), 1293 states have internal predecessors, (1696), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1728 transitions. [2024-11-28 03:03:20,611 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1728 transitions. Word has length 35 [2024-11-28 03:03:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:20,611 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1728 transitions. [2024-11-28 03:03:20,611 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-28 03:03:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1728 transitions. [2024-11-28 03:03:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 03:03:20,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:20,616 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-28 03:03:20,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:03:20,617 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-28 03:03:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -907140769, now seen corresponding path program 1 times [2024-11-28 03:03:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154852580] [2024-11-28 03:03:20,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154852580] [2024-11-28 03:03:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154852580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:20,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:20,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:03:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841162376] [2024-11-28 03:03:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:20,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:03:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:20,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:03:20,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:03:20,815 INFO L87 Difference]: Start difference. First operand 1302 states and 1728 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-28 03:03:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:20,878 INFO L93 Difference]: Finished difference Result 1302 states and 1720 transitions. [2024-11-28 03:03:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:03:20,879 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-28 03:03:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:20,885 INFO L225 Difference]: With dead ends: 1302 [2024-11-28 03:03:20,886 INFO L226 Difference]: Without dead ends: 1302 [2024-11-28 03:03:20,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:20,887 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 21 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2894 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-28 03:03:20,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2894 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:03:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-28 03:03:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2024-11-28 03:03:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 999 states have (on average 1.6896896896896898) internal successors, (1688), 1293 states have internal predecessors, (1688), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 03:03:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1720 transitions. [2024-11-28 03:03:20,976 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1720 transitions. Word has length 69 [2024-11-28 03:03:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:20,976 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1720 transitions. [2024-11-28 03:03:20,977 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-28 03:03:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1720 transitions. [2024-11-28 03:03:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-28 03:03:20,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:20,978 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-28 03:03:20,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:03:20,979 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-28 03:03:20,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1031867989, now seen corresponding path program 1 times [2024-11-28 03:03:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772598613] [2024-11-28 03:03:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:21,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772598613] [2024-11-28 03:03:21,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772598613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:21,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:21,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:03:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937568387] [2024-11-28 03:03:21,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:21,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:21,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:21,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:21,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:21,239 INFO L87 Difference]: Start difference. First operand 1302 states and 1720 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-28 03:03:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:21,332 INFO L93 Difference]: Finished difference Result 1833 states and 2483 transitions. [2024-11-28 03:03:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:21,333 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-28 03:03:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:21,342 INFO L225 Difference]: With dead ends: 1833 [2024-11-28 03:03:21,342 INFO L226 Difference]: Without dead ends: 1833 [2024-11-28 03:03:21,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:21,344 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 364 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2217 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-28 03:03:21,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:03:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2024-11-28 03:03:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1776. [2024-11-28 03:03:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1463 states have (on average 1.6596035543403964) internal successors, (2428), 1767 states have internal predecessors, (2428), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:03:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2480 transitions. [2024-11-28 03:03:21,386 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2480 transitions. Word has length 77 [2024-11-28 03:03:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:21,386 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2480 transitions. [2024-11-28 03:03:21,387 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-28 03:03:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2480 transitions. [2024-11-28 03:03:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 03:03:21,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:21,388 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-28 03:03:21,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:03:21,388 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-28 03:03:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash 646450878, now seen corresponding path program 1 times [2024-11-28 03:03:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053820368] [2024-11-28 03:03:21,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053820368] [2024-11-28 03:03:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053820368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:03:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674985159] [2024-11-28 03:03:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:03:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:03:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:21,927 INFO L87 Difference]: Start difference. First operand 1776 states and 2480 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-28 03:03:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:22,985 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2024-11-28 03:03:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:03:22,988 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-28 03:03:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:22,996 INFO L225 Difference]: With dead ends: 1775 [2024-11-28 03:03:22,996 INFO L226 Difference]: Without dead ends: 1775 [2024-11-28 03:03:22,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:03:22,997 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 2 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:22,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2953 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:03:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2024-11-28 03:03:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2024-11-28 03:03:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1463 states have (on average 1.6582365003417634) internal successors, (2426), 1766 states have internal predecessors, (2426), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:03:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2478 transitions. [2024-11-28 03:03:23,043 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2478 transitions. Word has length 85 [2024-11-28 03:03:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:23,043 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2478 transitions. [2024-11-28 03:03:23,044 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-28 03:03:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2478 transitions. [2024-11-28 03:03:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 03:03:23,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:23,045 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-28 03:03:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:03:23,045 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-28 03:03:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 646450879, now seen corresponding path program 1 times [2024-11-28 03:03:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932867711] [2024-11-28 03:03:23,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:23,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:23,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932867711] [2024-11-28 03:03:23,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932867711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:23,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:03:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054347103] [2024-11-28 03:03:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:23,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:03:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:23,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:03:23,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:23,960 INFO L87 Difference]: Start difference. First operand 1775 states and 2478 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-28 03:03:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:25,176 INFO L93 Difference]: Finished difference Result 1774 states and 2476 transitions. [2024-11-28 03:03:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:03:25,179 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-28 03:03:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:25,185 INFO L225 Difference]: With dead ends: 1774 [2024-11-28 03:03:25,185 INFO L226 Difference]: Without dead ends: 1774 [2024-11-28 03:03:25,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:03:25,186 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 1 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2891 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:25,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2891 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 03:03:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-28 03:03:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1774. [2024-11-28 03:03:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1461 states have (on average 1.6591375770020533) internal successors, (2424), 1765 states have internal predecessors, (2424), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:03:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2476 transitions. [2024-11-28 03:03:25,228 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2476 transitions. Word has length 85 [2024-11-28 03:03:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:25,228 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2476 transitions. [2024-11-28 03:03:25,228 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-28 03:03:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2476 transitions. [2024-11-28 03:03:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 03:03:25,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:25,230 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-28 03:03:25,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:03:25,230 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-28 03:03:25,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash 299903621, now seen corresponding path program 1 times [2024-11-28 03:03:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902395681] [2024-11-28 03:03:25,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902395681] [2024-11-28 03:03:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902395681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:25,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:03:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112655830] [2024-11-28 03:03:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:25,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:03:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:25,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:03:25,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:03:25,675 INFO L87 Difference]: Start difference. First operand 1774 states and 2476 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-28 03:03:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:26,923 INFO L93 Difference]: Finished difference Result 1792 states and 2502 transitions. [2024-11-28 03:03:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:03:26,923 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-28 03:03:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:26,930 INFO L225 Difference]: With dead ends: 1792 [2024-11-28 03:03:26,930 INFO L226 Difference]: Without dead ends: 1792 [2024-11-28 03:03:26,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:03:26,931 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 13 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4565 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:26,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4565 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 03:03:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-28 03:03:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1783. [2024-11-28 03:03:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1469 states have (on average 1.6575901974132063) internal successors, (2435), 1772 states have internal predecessors, (2435), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-28 03:03:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2492 transitions. [2024-11-28 03:03:26,982 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2492 transitions. Word has length 93 [2024-11-28 03:03:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:26,983 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2492 transitions. [2024-11-28 03:03:26,983 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-28 03:03:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2492 transitions. [2024-11-28 03:03:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 03:03:26,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:26,984 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-28 03:03:26,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:03:26,984 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-28 03:03:26,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash 299903622, now seen corresponding path program 1 times [2024-11-28 03:03:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:26,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380535124] [2024-11-28 03:03:26,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380535124] [2024-11-28 03:03:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380535124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:27,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:27,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:03:27,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636842898] [2024-11-28 03:03:27,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:27,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:03:27,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:27,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:03:27,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:03:27,847 INFO L87 Difference]: Start difference. First operand 1783 states and 2492 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-28 03:03:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:29,095 INFO L93 Difference]: Finished difference Result 1783 states and 2490 transitions. [2024-11-28 03:03:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:03:29,096 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-28 03:03:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:29,101 INFO L225 Difference]: With dead ends: 1783 [2024-11-28 03:03:29,102 INFO L226 Difference]: Without dead ends: 1783 [2024-11-28 03:03:29,102 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-28 03:03:29,102 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 8 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:29,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3692 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 03:03:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-11-28 03:03:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2024-11-28 03:03:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1469 states have (on average 1.6562287270251872) internal successors, (2433), 1772 states have internal predecessors, (2433), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-28 03:03:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2490 transitions. [2024-11-28 03:03:29,134 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2490 transitions. Word has length 93 [2024-11-28 03:03:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:29,135 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2490 transitions. [2024-11-28 03:03:29,135 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-28 03:03:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2490 transitions. [2024-11-28 03:03:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 03:03:29,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:29,136 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-28 03:03:29,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:03:29,136 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-28 03:03:29,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1269470577, now seen corresponding path program 1 times [2024-11-28 03:03:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804865863] [2024-11-28 03:03:29,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:29,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:29,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804865863] [2024-11-28 03:03:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804865863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958724555] [2024-11-28 03:03:29,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:29,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:29,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:29,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:29,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:03:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:30,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 03:03:30,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:30,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:03:30,374 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:03:30,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:03:30,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:03:30,553 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-28 03:03:30,784 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:03:30,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:03:30,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:03:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:30,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958724555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:30,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:03:30,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-28 03:03:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583968432] [2024-11-28 03:03:30,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:30,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:03:30,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:30,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:03:30,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=317, Unknown=7, NotChecked=0, Total=380 [2024-11-28 03:03:30,994 INFO L87 Difference]: Start difference. First operand 1783 states and 2490 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:03:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:34,668 INFO L93 Difference]: Finished difference Result 1790 states and 2496 transitions. [2024-11-28 03:03:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:03:34,670 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-28 03:03:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:34,680 INFO L225 Difference]: With dead ends: 1790 [2024-11-28 03:03:34,680 INFO L226 Difference]: Without dead ends: 1790 [2024-11-28 03:03:34,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=461, Unknown=8, NotChecked=0, Total=552 [2024-11-28 03:03:34,681 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 890 mSDsluCounter, 6182 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 6821 SdHoareTripleChecker+Invalid, 4072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:34,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 6821 Invalid, 4072 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-28 03:03:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-28 03:03:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1787. [2024-11-28 03:03:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1473 states have (on average 1.6537678207739308) internal successors, (2436), 1775 states have internal predecessors, (2436), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:03:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2490 transitions. [2024-11-28 03:03:34,731 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2490 transitions. Word has length 94 [2024-11-28 03:03:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:34,732 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2490 transitions. [2024-11-28 03:03:34,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:03:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2490 transitions. [2024-11-28 03:03:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 03:03:34,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:34,735 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-28 03:03:34,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:03:34,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 03:03:34,936 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-28 03:03:34,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1269470578, now seen corresponding path program 1 times [2024-11-28 03:03:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51034221] [2024-11-28 03:03:34,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51034221] [2024-11-28 03:03:36,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51034221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:36,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981832013] [2024-11-28 03:03:36,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:36,149 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:36,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:03:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:36,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 03:03:36,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:36,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:03:36,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:03:36,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:03:36,635 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-28 03:03:36,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:03:36,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:03:36,749 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-28 03:03:36,754 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-28 03:03:36,890 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:03:36,891 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-28 03:03:36,902 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-28 03:03:36,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:03:36,944 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-28 03:03:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:36,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981832013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:37,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:03:37,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2024-11-28 03:03:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256014255] [2024-11-28 03:03:37,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:37,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:03:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:37,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:03:37,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=247, Unknown=7, NotChecked=0, Total=306 [2024-11-28 03:03:37,124 INFO L87 Difference]: Start difference. First operand 1787 states and 2490 transitions. Second operand has 15 states, 12 states have (on average 11.833333333333334) internal successors, (142), 15 states have internal predecessors, (142), 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-28 03:03:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:39,353 INFO L93 Difference]: Finished difference Result 1789 states and 2494 transitions. [2024-11-28 03:03:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:03:39,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.833333333333334) internal successors, (142), 15 states have internal predecessors, (142), 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-28 03:03:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:39,359 INFO L225 Difference]: With dead ends: 1789 [2024-11-28 03:03:39,359 INFO L226 Difference]: Without dead ends: 1789 [2024-11-28 03:03:39,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=373, Unknown=8, NotChecked=0, Total=462 [2024-11-28 03:03:39,360 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 889 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:39,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 3350 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 03:03:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2024-11-28 03:03:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1777. [2024-11-28 03:03:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1465 states have (on average 1.6552901023890785) internal successors, (2425), 1767 states have internal predecessors, (2425), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:03:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2477 transitions. [2024-11-28 03:03:39,391 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2477 transitions. Word has length 94 [2024-11-28 03:03:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:39,392 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2477 transitions. [2024-11-28 03:03:39,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.833333333333334) internal successors, (142), 15 states have internal predecessors, (142), 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-28 03:03:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2477 transitions. [2024-11-28 03:03:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 03:03:39,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:39,393 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-28 03:03:39,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:03:39,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 03:03:39,598 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-28 03:03:39,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash 897444009, now seen corresponding path program 1 times [2024-11-28 03:03:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:39,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441014038] [2024-11-28 03:03:39,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441014038] [2024-11-28 03:03:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441014038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:40,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:03:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458359614] [2024-11-28 03:03:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:40,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:03:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:40,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:03:40,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:03:40,312 INFO L87 Difference]: Start difference. First operand 1777 states and 2477 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-28 03:03:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:43,233 INFO L93 Difference]: Finished difference Result 1796 states and 2502 transitions. [2024-11-28 03:03:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:03:43,234 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-28 03:03:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:43,239 INFO L225 Difference]: With dead ends: 1796 [2024-11-28 03:03:43,240 INFO L226 Difference]: Without dead ends: 1796 [2024-11-28 03:03:43,240 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-28 03:03:43,241 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 896 mSDsluCounter, 6774 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 7413 SdHoareTripleChecker+Invalid, 4451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:43,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 7413 Invalid, 4451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 03:03:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2024-11-28 03:03:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1792. [2024-11-28 03:03:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1479 states have (on average 1.6511156186612577) internal successors, (2442), 1780 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:03:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2496 transitions. [2024-11-28 03:03:43,274 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2496 transitions. Word has length 96 [2024-11-28 03:03:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:43,275 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2496 transitions. [2024-11-28 03:03:43,275 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-28 03:03:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2496 transitions. [2024-11-28 03:03:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 03:03:43,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:43,277 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-28 03:03:43,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:03:43,277 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-28 03:03:43,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash 897444010, now seen corresponding path program 1 times [2024-11-28 03:03:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:43,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944251643] [2024-11-28 03:03:43,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944251643] [2024-11-28 03:03:44,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944251643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:44,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:03:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400606386] [2024-11-28 03:03:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:44,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:03:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:44,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:03:44,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:03:44,373 INFO L87 Difference]: Start difference. First operand 1792 states and 2496 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-28 03:03:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:47,341 INFO L93 Difference]: Finished difference Result 1795 states and 2500 transitions. [2024-11-28 03:03:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:03:47,345 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-28 03:03:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:47,349 INFO L225 Difference]: With dead ends: 1795 [2024-11-28 03:03:47,349 INFO L226 Difference]: Without dead ends: 1795 [2024-11-28 03:03:47,350 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-28 03:03:47,350 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 912 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 4425 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:47,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 4425 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-28 03:03:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-28 03:03:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1792. [2024-11-28 03:03:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1479 states have (on average 1.649763353617309) internal successors, (2440), 1780 states have internal predecessors, (2440), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:03:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2494 transitions. [2024-11-28 03:03:47,378 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2494 transitions. Word has length 96 [2024-11-28 03:03:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:47,378 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2494 transitions. [2024-11-28 03:03:47,378 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-28 03:03:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2494 transitions. [2024-11-28 03:03:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 03:03:47,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:47,381 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-28 03:03:47,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:03:47,382 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-28 03:03:47,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1611564605, now seen corresponding path program 1 times [2024-11-28 03:03:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:47,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715241071] [2024-11-28 03:03:47,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:48,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715241071] [2024-11-28 03:03:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715241071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577667041] [2024-11-28 03:03:48,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:48,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:48,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:48,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:48,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:03:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:48,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:03:48,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:48,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:03:48,519 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:03:48,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:03:48,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:03:48,667 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-28 03:03:48,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:03:48,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:03:48,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:03:48,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:03:48,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:03:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:49,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:49,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (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_1012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:03:49,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1015 (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_1015))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1012)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:03:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577667041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:49,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:03:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-28 03:03:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378043769] [2024-11-28 03:03:49,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:49,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:03:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:49,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:03:49,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=429, Unknown=7, NotChecked=86, Total=600 [2024-11-28 03:03:49,126 INFO L87 Difference]: Start difference. First operand 1792 states and 2494 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:03:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:51,956 INFO L93 Difference]: Finished difference Result 1794 states and 2498 transitions. [2024-11-28 03:03:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:03:51,956 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-28 03:03:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:51,960 INFO L225 Difference]: With dead ends: 1794 [2024-11-28 03:03:51,960 INFO L226 Difference]: Without dead ends: 1794 [2024-11-28 03:03:51,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=552, Unknown=7, NotChecked=98, Total=756 [2024-11-28 03:03:51,961 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 875 mSDsluCounter, 6173 mSDsCounter, 0 mSdLazyCounter, 4075 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 6811 SdHoareTripleChecker+Invalid, 4096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:51,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 6811 Invalid, 4096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4075 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 03:03:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2024-11-28 03:03:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1791. [2024-11-28 03:03:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1479 states have (on average 1.6484110885733603) internal successors, (2438), 1779 states have internal predecessors, (2438), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:03:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2492 transitions. [2024-11-28 03:03:51,982 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2492 transitions. Word has length 97 [2024-11-28 03:03:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:51,983 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2492 transitions. [2024-11-28 03:03:51,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:03:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2492 transitions. [2024-11-28 03:03:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 03:03:51,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:51,984 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-28 03:03:51,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:03:52,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:52,185 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-28 03:03:52,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1611564606, now seen corresponding path program 1 times [2024-11-28 03:03:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992426260] [2024-11-28 03:03:52,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:52,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:53,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992426260] [2024-11-28 03:03:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992426260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20494867] [2024-11-28 03:03:53,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:53,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:53,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:53,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:53,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:03:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:53,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 03:03:53,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:53,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:03:53,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-28 03:03:53,568 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:03:53,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:03:53,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:03:53,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:03:53,726 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-28 03:03:53,732 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-28 03:03:53,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:03:53,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 62 treesize of output 57 [2024-11-28 03:03:53,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-28 03:03:53,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:03:53,989 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-28 03:03:53,998 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-28 03:03:54,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:03:54,021 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-28 03:03:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:54,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:54,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1166) |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_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:03:54,149 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_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-28 03:03:54,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1173 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1173) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1173 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1173) .cse1 v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:03:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20494867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:54,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:03:54,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-28 03:03:54,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068079592] [2024-11-28 03:03:54,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:54,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 03:03:54,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:54,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 03:03:54,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2024-11-28 03:03:54,222 INFO L87 Difference]: Start difference. First operand 1791 states and 2492 transitions. Second operand has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:03:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:57,740 INFO L93 Difference]: Finished difference Result 1793 states and 2496 transitions. [2024-11-28 03:03:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:03:57,741 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-28 03:03:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:57,745 INFO L225 Difference]: With dead ends: 1793 [2024-11-28 03:03:57,745 INFO L226 Difference]: Without dead ends: 1793 [2024-11-28 03:03:57,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2024-11-28 03:03:57,745 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 887 mSDsluCounter, 5246 mSDsCounter, 0 mSdLazyCounter, 4907 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 5887 SdHoareTripleChecker+Invalid, 4938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:57,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 5887 Invalid, 4938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4907 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-28 03:03:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-11-28 03:03:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1775. [2024-11-28 03:03:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1465 states have (on average 1.6525597269624572) internal successors, (2421), 1765 states have internal predecessors, (2421), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:03:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2473 transitions. [2024-11-28 03:03:57,772 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2473 transitions. Word has length 97 [2024-11-28 03:03:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:57,774 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2473 transitions. [2024-11-28 03:03:57,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:03:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2473 transitions. [2024-11-28 03:03:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 03:03:57,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:57,775 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-28 03:03:57,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:03:57,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 03:03:57,980 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-28 03:03:57,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -416292052, now seen corresponding path program 1 times [2024-11-28 03:03:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341567337] [2024-11-28 03:03:57,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:58,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:58,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341567337] [2024-11-28 03:03:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341567337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 03:03:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41217995] [2024-11-28 03:03:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:03:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:58,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:03:58,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:03:58,645 INFO L87 Difference]: Start difference. First operand 1775 states and 2473 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-28 03:04:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:00,516 INFO L93 Difference]: Finished difference Result 1800 states and 2504 transitions. [2024-11-28 03:04:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:04:00,518 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-28 03:04:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:00,525 INFO L225 Difference]: With dead ends: 1800 [2024-11-28 03:04:00,525 INFO L226 Difference]: Without dead ends: 1800 [2024-11-28 03:04:00,525 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-28 03:04:00,527 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 921 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 4968 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:00,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 4968 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2964 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 03:04:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2024-11-28 03:04:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1796. [2024-11-28 03:04:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1485 states have (on average 1.6457912457912458) internal successors, (2444), 1784 states have internal predecessors, (2444), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2498 transitions. [2024-11-28 03:04:00,552 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2498 transitions. Word has length 99 [2024-11-28 03:04:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:00,553 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2498 transitions. [2024-11-28 03:04:00,553 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-28 03:04:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2498 transitions. [2024-11-28 03:04:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 03:04:00,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:00,554 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-28 03:04:00,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:04:00,554 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-28 03:04:00,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:00,555 INFO L85 PathProgramCache]: Analyzing trace with hash -416292051, now seen corresponding path program 1 times [2024-11-28 03:04:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121618892] [2024-11-28 03:04:00,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121618892] [2024-11-28 03:04:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121618892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:04:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513749061] [2024-11-28 03:04:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:01,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:04:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:01,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:04:01,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:04:01,446 INFO L87 Difference]: Start difference. First operand 1796 states and 2498 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-28 03:04:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:03,597 INFO L93 Difference]: Finished difference Result 1799 states and 2502 transitions. [2024-11-28 03:04:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:04:03,598 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-28 03:04:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:03,602 INFO L225 Difference]: With dead ends: 1799 [2024-11-28 03:04:03,602 INFO L226 Difference]: Without dead ends: 1799 [2024-11-28 03:04:03,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:04:03,602 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 895 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 3095 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:03,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 3841 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3095 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 03:04:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-11-28 03:04:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1796. [2024-11-28 03:04:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1485 states have (on average 1.6444444444444444) internal successors, (2442), 1784 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2496 transitions. [2024-11-28 03:04:03,633 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2496 transitions. Word has length 99 [2024-11-28 03:04:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:03,633 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2496 transitions. [2024-11-28 03:04:03,633 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-28 03:04:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2496 transitions. [2024-11-28 03:04:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 03:04:03,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:03,634 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-28 03:04:03,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:04:03,634 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-28 03:04:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 977366296, now seen corresponding path program 1 times [2024-11-28 03:04:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:03,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30069575] [2024-11-28 03:04:03,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30069575] [2024-11-28 03:04:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30069575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476050834] [2024-11-28 03:04:04,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:04,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:04,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:04,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:04,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:04:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:04,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 03:04:04,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:04,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:04:04,749 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:04:04,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:04:04,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:04:04,886 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-28 03:04:05,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:05,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:05,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:05,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:05,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:05,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:05,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:04:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:05,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:05,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (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_1482))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1478)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1479)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:04:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476050834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:05,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:04:05,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-28 03:04:05,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093811912] [2024-11-28 03:04:05,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:05,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:04:05,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:05,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:04:05,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=609, Unknown=42, NotChecked=52, Total=812 [2024-11-28 03:04:05,744 INFO L87 Difference]: Start difference. First operand 1796 states and 2496 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:09,041 INFO L93 Difference]: Finished difference Result 1798 states and 2500 transitions. [2024-11-28 03:04:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:04:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-28 03:04:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:09,045 INFO L225 Difference]: With dead ends: 1798 [2024-11-28 03:04:09,045 INFO L226 Difference]: Without dead ends: 1798 [2024-11-28 03:04:09,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=759, Unknown=43, NotChecked=58, Total=992 [2024-11-28 03:04:09,048 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 866 mSDsluCounter, 8584 mSDsCounter, 0 mSdLazyCounter, 5543 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 9221 SdHoareTripleChecker+Invalid, 5563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:09,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 9221 Invalid, 5563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5543 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 03:04:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-11-28 03:04:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1795. [2024-11-28 03:04:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1485 states have (on average 1.6430976430976432) internal successors, (2440), 1783 states have internal predecessors, (2440), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2494 transitions. [2024-11-28 03:04:09,074 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2494 transitions. Word has length 100 [2024-11-28 03:04:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:09,075 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2494 transitions. [2024-11-28 03:04:09,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2494 transitions. [2024-11-28 03:04:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 03:04:09,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:09,081 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-28 03:04:09,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:04:09,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 03:04:09,282 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-28 03:04:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:09,283 INFO L85 PathProgramCache]: Analyzing trace with hash 977366297, now seen corresponding path program 1 times [2024-11-28 03:04:09,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:09,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567270066] [2024-11-28 03:04:09,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567270066] [2024-11-28 03:04:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567270066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699104118] [2024-11-28 03:04:10,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:10,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:10,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:10,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:10,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:04:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:10,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 03:04:10,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:10,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:04:11,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:04:11,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:04:11,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-28 03:04:11,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:04:11,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:04:11,256 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-28 03:04:11,261 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-28 03:04:11,405 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:11,406 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-28 03:04:11,415 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-28 03:04:11,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:11,510 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-28 03:04:11,522 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-28 03:04:11,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:11,610 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-28 03:04:11,621 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 41 treesize of output 22 [2024-11-28 03:04:11,678 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 30 treesize of output 12 [2024-11-28 03:04:11,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:04:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:11,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:12,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1653))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1654) .cse3 v_ArrVal_1645))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1653))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1654) .cse8 v_ArrVal_1645))) (or (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1646))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))))) is different from false [2024-11-28 03:04:12,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699104118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:12,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:04:12,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-28 03:04:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276796913] [2024-11-28 03:04:12,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 03:04:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:12,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 03:04:12,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=688, Unknown=18, NotChecked=54, Total=870 [2024-11-28 03:04:12,379 INFO L87 Difference]: Start difference. First operand 1795 states and 2494 transitions. Second operand has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:16,143 INFO L93 Difference]: Finished difference Result 1797 states and 2498 transitions. [2024-11-28 03:04:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:04:16,143 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-28 03:04:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:16,147 INFO L225 Difference]: With dead ends: 1797 [2024-11-28 03:04:16,147 INFO L226 Difference]: Without dead ends: 1797 [2024-11-28 03:04:16,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=996, Unknown=18, NotChecked=66, Total=1260 [2024-11-28 03:04:16,148 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 880 mSDsluCounter, 6366 mSDsCounter, 0 mSdLazyCounter, 5749 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 7006 SdHoareTripleChecker+Invalid, 5772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:16,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 7006 Invalid, 5772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5749 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 03:04:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-11-28 03:04:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1773. [2024-11-28 03:04:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1465 states have (on average 1.6498293515358362) internal successors, (2417), 1763 states have internal predecessors, (2417), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:04:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2469 transitions. [2024-11-28 03:04:16,190 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2469 transitions. Word has length 100 [2024-11-28 03:04:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:16,190 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2469 transitions. [2024-11-28 03:04:16,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.0) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2469 transitions. [2024-11-28 03:04:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 03:04:16,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:16,191 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-28 03:04:16,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:04:16,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 03:04:16,396 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-28 03:04:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2109690096, now seen corresponding path program 1 times [2024-11-28 03:04:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:16,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964426775] [2024-11-28 03:04:16,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:17,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964426775] [2024-11-28 03:04:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964426775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:17,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:17,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:04:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169244450] [2024-11-28 03:04:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:17,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:04:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:17,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:04:17,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:04:17,122 INFO L87 Difference]: Start difference. First operand 1773 states and 2469 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-28 03:04:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:18,758 INFO L93 Difference]: Finished difference Result 1804 states and 2506 transitions. [2024-11-28 03:04:18,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:04:18,759 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-28 03:04:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:18,762 INFO L225 Difference]: With dead ends: 1804 [2024-11-28 03:04:18,763 INFO L226 Difference]: Without dead ends: 1804 [2024-11-28 03:04:18,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:04:18,763 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 921 mSDsluCounter, 3723 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 4363 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:18,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 4363 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 03:04:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-28 03:04:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1800. [2024-11-28 03:04:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1491 states have (on average 1.6405097250167673) internal successors, (2446), 1788 states have internal predecessors, (2446), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2500 transitions. [2024-11-28 03:04:18,787 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2500 transitions. Word has length 102 [2024-11-28 03:04:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:18,787 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2500 transitions. [2024-11-28 03:04:18,788 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-28 03:04:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2500 transitions. [2024-11-28 03:04:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 03:04:18,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:18,789 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-28 03:04:18,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 03:04:18,789 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-28 03:04:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2109690097, now seen corresponding path program 1 times [2024-11-28 03:04:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235991300] [2024-11-28 03:04:18,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235991300] [2024-11-28 03:04:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235991300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:19,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:19,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:04:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061050274] [2024-11-28 03:04:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:19,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:04:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:19,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:04:19,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:04:19,900 INFO L87 Difference]: Start difference. First operand 1800 states and 2500 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-28 03:04:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:21,787 INFO L93 Difference]: Finished difference Result 1803 states and 2504 transitions. [2024-11-28 03:04:21,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:04:21,788 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-28 03:04:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:21,791 INFO L225 Difference]: With dead ends: 1803 [2024-11-28 03:04:21,791 INFO L226 Difference]: Without dead ends: 1803 [2024-11-28 03:04:21,791 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-28 03:04:21,792 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 897 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:21,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 3356 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 03:04:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-28 03:04:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1800. [2024-11-28 03:04:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1491 states have (on average 1.6391683433936954) internal successors, (2444), 1788 states have internal predecessors, (2444), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2498 transitions. [2024-11-28 03:04:21,817 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2498 transitions. Word has length 102 [2024-11-28 03:04:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:21,817 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2498 transitions. [2024-11-28 03:04:21,818 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-28 03:04:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2498 transitions. [2024-11-28 03:04:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 03:04:21,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:21,819 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-28 03:04:21,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:04:21,819 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-28 03:04:21,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1136684932, now seen corresponding path program 1 times [2024-11-28 03:04:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504574847] [2024-11-28 03:04:21,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504574847] [2024-11-28 03:04:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504574847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000233345] [2024-11-28 03:04:22,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:22,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:22,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:22,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:04:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:22,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:04:22,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:22,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:04:23,084 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:04:23,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:04:23,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:04:23,246 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-28 03:04:23,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:23,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:23,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:23,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:23,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:23,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:23,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:23,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:23,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:04:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:23,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:23,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (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~mem57#1.base| v_ArrVal_1984))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1985)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:04:23,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1984 (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_1984))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1985)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:04:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000233345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:24,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:04:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-28 03:04:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072675371] [2024-11-28 03:04:24,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:24,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:04:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:24,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:04:24,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=747, Unknown=60, NotChecked=118, Total=1056 [2024-11-28 03:04:24,126 INFO L87 Difference]: Start difference. First operand 1800 states and 2498 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:27,144 INFO L93 Difference]: Finished difference Result 1802 states and 2502 transitions. [2024-11-28 03:04:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:04:27,145 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-28 03:04:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:27,148 INFO L225 Difference]: With dead ends: 1802 [2024-11-28 03:04:27,148 INFO L226 Difference]: Without dead ends: 1802 [2024-11-28 03:04:27,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=915, Unknown=61, NotChecked=130, Total=1260 [2024-11-28 03:04:27,150 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 865 mSDsluCounter, 7973 mSDsCounter, 0 mSdLazyCounter, 5065 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 8609 SdHoareTripleChecker+Invalid, 5083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:27,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 8609 Invalid, 5083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5065 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-28 03:04:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-28 03:04:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1799. [2024-11-28 03:04:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1491 states have (on average 1.6378269617706238) internal successors, (2442), 1787 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2496 transitions. [2024-11-28 03:04:27,180 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2496 transitions. Word has length 103 [2024-11-28 03:04:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:27,180 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2496 transitions. [2024-11-28 03:04:27,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2496 transitions. [2024-11-28 03:04:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 03:04:27,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:27,182 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-28 03:04:27,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:04:27,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 03:04:27,386 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-28 03:04:27,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1136684933, now seen corresponding path program 1 times [2024-11-28 03:04:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433055151] [2024-11-28 03:04:27,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433055151] [2024-11-28 03:04:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433055151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536668699] [2024-11-28 03:04:28,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:28,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:28,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:28,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:28,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:04:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:28,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 03:04:28,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:28,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:04:28,984 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:04:28,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:04:28,990 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-28 03:04:29,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:04:29,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:04:29,125 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-28 03:04:29,135 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-28 03:04:29,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:29,270 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-28 03:04:29,274 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-28 03:04:29,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:29,367 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-28 03:04:29,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-28 03:04:29,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:29,451 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-28 03:04:29,459 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-28 03:04:29,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:29,531 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-28 03:04:29,539 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-28 03:04:29,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-28 03:04:29,561 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-28 03:04:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:29,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:29,760 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_2167 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:04:29,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2166))) (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_2165) .cse0 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2165) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-28 03:04:29,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2166))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2165) .cse1 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2165) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-28 03:04:29,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2164))) (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_2163) .cse0 v_ArrVal_2165) (select (select (store .cse1 .cse0 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2164))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2166))) (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_2163) .cse3 v_ArrVal_2165) .cse4 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 03:04:29,887 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_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2164))) (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_2163) .cse1 v_ArrVal_2165) (select (select (store .cse2 .cse1 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2164))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2166))) (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_2163) .cse4 v_ArrVal_2165) .cse5 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-28 03:04:29,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2174))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2164))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2166))) (let ((.cse2 (select (select .cse4 |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_2173) .cse0 v_ArrVal_2163) .cse1 v_ArrVal_2165) .cse2 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2174))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2164))) (let ((.cse8 (select (select .cse9 |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_2173) .cse7 v_ArrVal_2163) .cse8 v_ArrVal_2165) (select (select (store .cse9 .cse8 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-28 03:04:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536668699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:29,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:04:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-28 03:04:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026639670] [2024-11-28 03:04:29,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:29,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:04:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:29,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:04:29,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=603, Unknown=20, NotChecked=330, Total=1056 [2024-11-28 03:04:29,983 INFO L87 Difference]: Start difference. First operand 1799 states and 2496 transitions. Second operand has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:33,212 INFO L93 Difference]: Finished difference Result 1801 states and 2500 transitions. [2024-11-28 03:04:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:04:33,212 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-28 03:04:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:33,215 INFO L225 Difference]: With dead ends: 1801 [2024-11-28 03:04:33,215 INFO L226 Difference]: Without dead ends: 1801 [2024-11-28 03:04:33,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=957, Unknown=22, NotChecked=414, Total=1560 [2024-11-28 03:04:33,216 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 880 mSDsluCounter, 4809 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 5448 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:33,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 5448 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 03:04:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-28 03:04:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1771. [2024-11-28 03:04:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1465 states have (on average 1.647098976109215) internal successors, (2413), 1761 states have internal predecessors, (2413), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:04:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2465 transitions. [2024-11-28 03:04:33,240 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2465 transitions. Word has length 103 [2024-11-28 03:04:33,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:33,240 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2465 transitions. [2024-11-28 03:04:33,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:04:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2465 transitions. [2024-11-28 03:04:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 03:04:33,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:33,241 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-28 03:04:33,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 03:04:33,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 03:04:33,442 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-28 03:04:33,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:33,443 INFO L85 PathProgramCache]: Analyzing trace with hash -66517710, now seen corresponding path program 1 times [2024-11-28 03:04:33,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:33,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917918063] [2024-11-28 03:04:33,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917918063] [2024-11-28 03:04:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917918063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:04:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394420208] [2024-11-28 03:04:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:34,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:04:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:34,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:04:34,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:04:34,190 INFO L87 Difference]: Start difference. First operand 1771 states and 2465 transitions. Second operand has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 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-28 03:04:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:35,752 INFO L93 Difference]: Finished difference Result 1810 states and 2510 transitions. [2024-11-28 03:04:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:04:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 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-28 03:04:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:35,755 INFO L225 Difference]: With dead ends: 1810 [2024-11-28 03:04:35,755 INFO L226 Difference]: Without dead ends: 1810 [2024-11-28 03:04:35,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-28 03:04:35,755 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 919 mSDsluCounter, 3667 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 4306 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:35,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 4306 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 03:04:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-28 03:04:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1806. [2024-11-28 03:04:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1499 states have (on average 1.6344229486324215) internal successors, (2450), 1794 states have internal predecessors, (2450), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2504 transitions. [2024-11-28 03:04:35,775 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2504 transitions. Word has length 106 [2024-11-28 03:04:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:35,776 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2504 transitions. [2024-11-28 03:04:35,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 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-28 03:04:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2504 transitions. [2024-11-28 03:04:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 03:04:35,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:35,777 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-28 03:04:35,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 03:04:35,777 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-28 03:04:35,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -66517709, now seen corresponding path program 1 times [2024-11-28 03:04:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:35,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560255638] [2024-11-28 03:04:35,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:35,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560255638] [2024-11-28 03:04:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560255638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:37,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:37,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 03:04:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821046755] [2024-11-28 03:04:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:37,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:04:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:37,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:04:37,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:04:37,241 INFO L87 Difference]: Start difference. First operand 1806 states and 2504 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-28 03:04:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:40,626 INFO L93 Difference]: Finished difference Result 1809 states and 2508 transitions. [2024-11-28 03:04:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:04:40,627 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-28 03:04:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:40,629 INFO L225 Difference]: With dead ends: 1809 [2024-11-28 03:04:40,629 INFO L226 Difference]: Without dead ends: 1809 [2024-11-28 03:04:40,630 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-28 03:04:40,630 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 898 mSDsluCounter, 5001 mSDsCounter, 0 mSdLazyCounter, 4252 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 5637 SdHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:40,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 5637 Invalid, 4274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4252 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 03:04:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-28 03:04:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1806. [2024-11-28 03:04:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1499 states have (on average 1.6330887258172115) internal successors, (2448), 1794 states have internal predecessors, (2448), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2502 transitions. [2024-11-28 03:04:40,652 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2502 transitions. Word has length 106 [2024-11-28 03:04:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:40,653 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2502 transitions. [2024-11-28 03:04:40,653 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-28 03:04:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2502 transitions. [2024-11-28 03:04:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 03:04:40,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:40,654 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-28 03:04:40,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 03:04:40,655 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-28 03:04:40,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2005878330, now seen corresponding path program 1 times [2024-11-28 03:04:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49902900] [2024-11-28 03:04:40,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:41,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:41,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49902900] [2024-11-28 03:04:41,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49902900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:41,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292259163] [2024-11-28 03:04:41,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:41,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:41,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:41,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:41,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:04:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:41,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 03:04:41,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:41,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:04:42,097 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:04:42,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:04:42,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:04:42,239 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-28 03:04:42,380 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:42,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:42,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:42,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:42,557 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:42,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:42,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:42,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:42,685 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:42,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:04:42,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:04:42,766 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-28 03:04:42,766 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-28 03:04:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:42,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292259163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:43,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:04:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-28 03:04:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776031236] [2024-11-28 03:04:43,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:43,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:04:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:43,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:04:43,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1091, Unknown=51, NotChecked=0, Total=1332 [2024-11-28 03:04:43,585 INFO L87 Difference]: Start difference. First operand 1806 states and 2502 transitions. Second operand has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 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-28 03:04:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:46,473 INFO L93 Difference]: Finished difference Result 1808 states and 2506 transitions. [2024-11-28 03:04:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:04:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 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-28 03:04:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:46,475 INFO L225 Difference]: With dead ends: 1808 [2024-11-28 03:04:46,475 INFO L226 Difference]: Without dead ends: 1808 [2024-11-28 03:04:46,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=1151, Unknown=51, NotChecked=0, Total=1406 [2024-11-28 03:04:46,476 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 856 mSDsluCounter, 7366 mSDsCounter, 0 mSdLazyCounter, 4828 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 8004 SdHoareTripleChecker+Invalid, 4845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:46,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 8004 Invalid, 4845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4828 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 03:04:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-28 03:04:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1805. [2024-11-28 03:04:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1499 states have (on average 1.6317545030020013) internal successors, (2446), 1793 states have internal predecessors, (2446), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:04:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2500 transitions. [2024-11-28 03:04:46,501 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2500 transitions. Word has length 107 [2024-11-28 03:04:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:46,502 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2500 transitions. [2024-11-28 03:04:46,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 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-28 03:04:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2500 transitions. [2024-11-28 03:04:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 03:04:46,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:46,503 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-28 03:04:46,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:04:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:46,704 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-28 03:04:46,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2005878329, now seen corresponding path program 1 times [2024-11-28 03:04:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:46,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977406539] [2024-11-28 03:04:46,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:48,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-28 03:04:48,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977406539] [2024-11-28 03:04:48,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977406539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464216131] [2024-11-28 03:04:48,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:48,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:48,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:48,081 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:48,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:04:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:48,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 03:04:48,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:48,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:04:48,545 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-28 03:04:48,565 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:04:48,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:04:48,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:04:48,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:04:48,758 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-28 03:04:48,762 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-28 03:04:48,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:48,953 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-28 03:04:48,962 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-28 03:04:49,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:49,095 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-28 03:04:49,103 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-28 03:04:49,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:49,203 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-28 03:04:49,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:04:49,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:49,333 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-28 03:04:49,354 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-28 03:04:49,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:04:49,459 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-28 03:04:49,464 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-28 03:04:49,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-28 03:04:49,504 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-28 03:04:49,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:04:49,567 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-28 03:04:49,581 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:04:49,582 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-28 03:04:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:49,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:50,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2738))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2737) .cse0 v_ArrVal_2740) (select (select (store .cse1 .cse0 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2742))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2743 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2738))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2739))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2737) .cse3 v_ArrVal_2740) .cse4 v_ArrVal_2742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2743) (select (select (store .cse5 .cse4 v_ArrVal_2741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-28 03:05:07,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464216131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:05:07,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:05:07,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2024-11-28 03:05:07,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843980919] [2024-11-28 03:05:07,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:05:07,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:05:07,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:07,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:05:07,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1413, Unknown=49, NotChecked=78, Total=1722 [2024-11-28 03:05:07,439 INFO L87 Difference]: Start difference. First operand 1805 states and 2500 transitions. Second operand has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 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-28 03:05:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:50,012 INFO L93 Difference]: Finished difference Result 1807 states and 2504 transitions. [2024-11-28 03:05:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:05:50,013 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 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-28 03:05:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:50,015 INFO L225 Difference]: With dead ends: 1807 [2024-11-28 03:05:50,015 INFO L226 Difference]: Without dead ends: 1807 [2024-11-28 03:05:50,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=309, Invalid=2196, Unknown=49, NotChecked=98, Total=2652 [2024-11-28 03:05:50,016 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 862 mSDsluCounter, 9199 mSDsCounter, 0 mSdLazyCounter, 8733 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 9834 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:50,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 9834 Invalid, 8759 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 8733 Invalid, 0 Unknown, 0 Unchecked, 40.4s Time] [2024-11-28 03:05:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-28 03:05:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1769. [2024-11-28 03:05:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1465 states have (on average 1.644368600682594) internal successors, (2409), 1759 states have internal predecessors, (2409), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:05:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2461 transitions. [2024-11-28 03:05:50,035 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2461 transitions. Word has length 107 [2024-11-28 03:05:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:50,035 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2461 transitions. [2024-11-28 03:05:50,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 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-28 03:05:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2461 transitions. [2024-11-28 03:05:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 03:05:50,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:50,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:50,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:05:50,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:05:50,236 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-28 03:05:50,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1648499879, now seen corresponding path program 1 times [2024-11-28 03:05:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:50,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658700505] [2024-11-28 03:05:50,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658700505] [2024-11-28 03:05:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658700505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:51,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:51,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:05:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644983273] [2024-11-28 03:05:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:51,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:05:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:51,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:05:51,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:05:51,020 INFO L87 Difference]: Start difference. First operand 1769 states and 2461 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:05:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:57,074 INFO L93 Difference]: Finished difference Result 1768 states and 2459 transitions. [2024-11-28 03:05:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:05:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 03:05:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:57,077 INFO L225 Difference]: With dead ends: 1768 [2024-11-28 03:05:57,077 INFO L226 Difference]: Without dead ends: 1768 [2024-11-28 03:05:57,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:05:57,078 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 2 mSDsluCounter, 3602 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4575 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:57,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4575 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-28 03:05:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-28 03:05:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1768. [2024-11-28 03:05:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1465 states have (on average 1.6430034129692832) internal successors, (2407), 1758 states have internal predecessors, (2407), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:05:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2459 transitions. [2024-11-28 03:05:57,096 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2459 transitions. Word has length 109 [2024-11-28 03:05:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:57,097 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2459 transitions. [2024-11-28 03:05:57,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:05:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2459 transitions. [2024-11-28 03:05:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 03:05:57,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:57,097 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-28 03:05:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 03:05:57,098 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-28 03:05:57,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1648499878, now seen corresponding path program 1 times [2024-11-28 03:05:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:57,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731379355] [2024-11-28 03:05:57,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:06:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:06:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:06:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731379355] [2024-11-28 03:06:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731379355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:06:00,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:06:00,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:06:00,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392303397] [2024-11-28 03:06:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:06:00,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:06:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:06:00,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:06:00,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:06:00,800 INFO L87 Difference]: Start difference. First operand 1768 states and 2459 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-28 03:06:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:06:18,232 INFO L93 Difference]: Finished difference Result 1812 states and 2508 transitions. [2024-11-28 03:06:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:06:18,233 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-28 03:06:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:06:18,235 INFO L225 Difference]: With dead ends: 1812 [2024-11-28 03:06:18,235 INFO L226 Difference]: Without dead ends: 1812 [2024-11-28 03:06:18,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:06:18,236 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 898 mSDsluCounter, 3804 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 3545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:06:18,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 4440 Invalid, 3545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3524 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2024-11-28 03:06:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-28 03:06:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1809. [2024-11-28 03:06:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1505 states have (on average 1.626578073089701) internal successors, (2448), 1797 states have internal predecessors, (2448), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:06:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2502 transitions. [2024-11-28 03:06:18,253 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2502 transitions. Word has length 109 [2024-11-28 03:06:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:06:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2502 transitions. [2024-11-28 03:06:18,254 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-28 03:06:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2502 transitions. [2024-11-28 03:06:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:06:18,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:06:18,255 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-28 03:06:18,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:06:18,255 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:06:18,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:06:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1240664506, now seen corresponding path program 1 times [2024-11-28 03:06:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:06:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458665438] [2024-11-28 03:06:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:06:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:06:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:06:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:06:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:06:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458665438] [2024-11-28 03:06:21,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458665438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:06:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966057293] [2024-11-28 03:06:21,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:06:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:06:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:06:21,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:06:21,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:06:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:06:21,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 03:06:21,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:06:22,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:06:22,766 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:06:22,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:06:22,815 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-28 03:06:22,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:06:23,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:06:23,732 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-28 03:06:23,744 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-28 03:06:24,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:06:24,631 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-28 03:06:24,645 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-28 03:06:25,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:06:25,242 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-28 03:06:25,284 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-28 03:06:25,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:06:25,703 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-28 03:06:25,735 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-28 03:06:26,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:06:26,176 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-28 03:06:26,188 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-28 03:06:26,753 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:06:26,754 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-28 03:06:26,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:06:27,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:06:27,209 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-28 03:06:27,302 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:06:27,302 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-28 03:06:27,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:06:27,482 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-28 03:06:27,518 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-28 03:06:27,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:06:27,589 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-28 03:06:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:06:27,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:06:27,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3148 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3148) |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_3147) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:06:28,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |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_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3145) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3144) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int))) (or (forall ((v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3146 Int) (v_ArrVal_3148 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3144))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3145) .cse1 v_ArrVal_3148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3146) (select (select (store .cse2 .cse1 v_ArrVal_3147) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:06:51,930 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3141 (Array Int Int)) (v_ArrVal_3142 (Array Int Int)) (v_ArrVal_3143 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3138 (Array Int Int)) (v_ArrVal_3139 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3138))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3140))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3142))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3139) .cse0 v_ArrVal_3141) .cse1 v_ArrVal_3143) .cse2 v_ArrVal_3145) (select (select (store .cse3 .cse2 v_ArrVal_3144) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3148))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (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_3140 (Array Int Int)) (v_ArrVal_3141 (Array Int Int)) (v_ArrVal_3142 (Array Int Int)) (v_ArrVal_3143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 (Array Int Int)) (v_ArrVal_3139 (Array Int Int))) (or (forall ((v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3146 Int) (v_ArrVal_3148 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3138))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3140))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3142))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3144))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3139) .cse7 v_ArrVal_3141) .cse8 v_ArrVal_3143) .cse9 v_ArrVal_3145) .cse10 v_ArrVal_3148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3146) (select (select (store .cse11 .cse10 v_ArrVal_3147) |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-28 03:06:52,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (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_3140 (Array Int Int)) (v_ArrVal_3141 (Array Int Int)) (v_ArrVal_3142 (Array Int Int)) (v_ArrVal_3143 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3138 (Array Int Int)) (v_ArrVal_3139 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3138))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3140))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3142))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3139) .cse1 v_ArrVal_3141) .cse2 v_ArrVal_3143) .cse3 v_ArrVal_3145) (select (select (store .cse4 .cse3 v_ArrVal_3144) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3148))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3141 (Array Int Int)) (v_ArrVal_3142 (Array Int Int)) (v_ArrVal_3143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 (Array Int Int)) (v_ArrVal_3139 (Array Int Int))) (or (forall ((v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3146 Int) (v_ArrVal_3148 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3138))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3140))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3142))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3144))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3139) .cse8 v_ArrVal_3141) .cse9 v_ArrVal_3143) .cse10 v_ArrVal_3145) .cse11 v_ArrVal_3148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3146) (select (select (store .cse12 .cse11 v_ArrVal_3147) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-28 03:06:52,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3141 (Array Int Int)) (v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3142 (Array Int Int)) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3143 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3138 (Array Int Int)) (v_ArrVal_3139 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3154))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3138))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3140))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3142))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3153) .cse0 v_ArrVal_3139) .cse1 v_ArrVal_3141) .cse2 v_ArrVal_3143) .cse3 v_ArrVal_3145) (select (select (store .cse4 .cse3 v_ArrVal_3144) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3148))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3141 (Array Int Int)) (v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3142 (Array Int Int)) (v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3138 (Array Int Int)) (v_ArrVal_3139 (Array Int Int))) (or (forall ((v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3146 Int) (v_ArrVal_3148 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3154))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_3138))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3140))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3142))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3144))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3153) .cse9 v_ArrVal_3139) .cse10 v_ArrVal_3141) .cse11 v_ArrVal_3143) .cse12 v_ArrVal_3145) .cse13 v_ArrVal_3148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3146) (select (select (store .cse14 .cse13 v_ArrVal_3147) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:06:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966057293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:06:52,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:06:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 29 [2024-11-28 03:06:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540349688] [2024-11-28 03:06:52,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:06:52,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:06:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:06:52,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:06:52,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1236, Unknown=32, NotChecked=390, Total=1892 [2024-11-28 03:06:52,583 INFO L87 Difference]: Start difference. First operand 1809 states and 2502 transitions. Second operand has 30 states, 27 states have (on average 6.62962962962963) internal successors, (179), 29 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:07:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:41,699 INFO L93 Difference]: Finished difference Result 1811 states and 2506 transitions. [2024-11-28 03:07:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:07:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.62962962962963) internal successors, (179), 29 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-28 03:07:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:41,702 INFO L225 Difference]: With dead ends: 1811 [2024-11-28 03:07:41,702 INFO L226 Difference]: Without dead ends: 1811 [2024-11-28 03:07:41,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=260, Invalid=1450, Unknown=32, NotChecked=420, Total=2162 [2024-11-28 03:07:41,703 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 855 mSDsluCounter, 6777 mSDsCounter, 0 mSdLazyCounter, 6160 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 7411 SdHoareTripleChecker+Invalid, 6185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:41,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 7411 Invalid, 6185 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6160 Invalid, 0 Unknown, 0 Unchecked, 48.1s Time] [2024-11-28 03:07:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-28 03:07:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1767. [2024-11-28 03:07:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1465 states have (on average 1.6416382252559727) internal successors, (2405), 1757 states have internal predecessors, (2405), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:07:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2457 transitions. [2024-11-28 03:07:41,717 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2457 transitions. Word has length 110 [2024-11-28 03:07:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2457 transitions. [2024-11-28 03:07:41,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.62962962962963) internal successors, (179), 29 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:07:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2457 transitions. [2024-11-28 03:07:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 03:07:41,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:41,718 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, 1, 1] [2024-11-28 03:07:41,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 03:07:41,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:07:41,919 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:07:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1803150599, now seen corresponding path program 1 times [2024-11-28 03:07:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554124720] [2024-11-28 03:07:41,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:07:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554124720] [2024-11-28 03:07:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554124720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:44,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:07:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143363376] [2024-11-28 03:07:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:44,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:07:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:44,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:07:44,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:07:44,484 INFO L87 Difference]: Start difference. First operand 1767 states and 2457 transitions. Second operand has 10 states, 9 states have (on average 12.222222222222221) internal successors, (110), 10 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:08:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:05,254 INFO L93 Difference]: Finished difference Result 1766 states and 2455 transitions. [2024-11-28 03:08:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:08:05,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.222222222222221) internal successors, (110), 10 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-28 03:08:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:05,258 INFO L225 Difference]: With dead ends: 1766 [2024-11-28 03:08:05,258 INFO L226 Difference]: Without dead ends: 1766 [2024-11-28 03:08:05,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:08:05,259 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 1746 mSDsluCounter, 3720 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 4364 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:05,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 4364 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2507 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2024-11-28 03:08:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-28 03:08:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2024-11-28 03:08:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1465 states have (on average 1.6402730375426622) internal successors, (2403), 1756 states have internal predecessors, (2403), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:08:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2455 transitions. [2024-11-28 03:08:05,284 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2455 transitions. Word has length 112 [2024-11-28 03:08:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2455 transitions. [2024-11-28 03:08:05,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.222222222222221) internal successors, (110), 10 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:08:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2455 transitions. [2024-11-28 03:08:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 03:08:05,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:05,286 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, 1, 1] [2024-11-28 03:08:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 03:08:05,287 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:08:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1803150598, now seen corresponding path program 1 times [2024-11-28 03:08:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68426112] [2024-11-28 03:08:05,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68426112] [2024-11-28 03:08:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68426112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 03:08:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071715756] [2024-11-28 03:08:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:08:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:08,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:08:08,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:08:08,785 INFO L87 Difference]: Start difference. First operand 1766 states and 2455 transitions. Second operand has 16 states, 15 states have (on average 7.333333333333333) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:08:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:46,601 INFO L93 Difference]: Finished difference Result 1850 states and 2558 transitions. [2024-11-28 03:08:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:08:46,601 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.333333333333333) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-28 03:08:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:46,603 INFO L225 Difference]: With dead ends: 1850 [2024-11-28 03:08:46,604 INFO L226 Difference]: Without dead ends: 1850 [2024-11-28 03:08:46,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 03:08:46,604 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 965 mSDsluCounter, 6600 mSDsCounter, 0 mSdLazyCounter, 4709 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 7240 SdHoareTripleChecker+Invalid, 4730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:46,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 7240 Invalid, 4730 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4709 Invalid, 0 Unknown, 0 Unchecked, 36.1s Time] [2024-11-28 03:08:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-11-28 03:08:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1813. [2024-11-28 03:08:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1511 states have (on average 1.6214427531436135) internal successors, (2450), 1801 states have internal predecessors, (2450), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:08:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2504 transitions. [2024-11-28 03:08:46,624 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2504 transitions. Word has length 112 [2024-11-28 03:08:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:46,625 INFO L471 AbstractCegarLoop]: Abstraction has 1813 states and 2504 transitions. [2024-11-28 03:08:46,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.333333333333333) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:08:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2504 transitions. [2024-11-28 03:08:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 03:08:46,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:46,626 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, 1, 1, 1] [2024-11-28 03:08:46,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 03:08:46,626 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:08:46,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:46,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1852903566, now seen corresponding path program 1 times [2024-11-28 03:08:46,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:46,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988588063] [2024-11-28 03:08:46,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:50,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988588063] [2024-11-28 03:08:50,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988588063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:08:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043961346] [2024-11-28 03:08:50,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:50,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:08:50,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:08:50,805 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:08:50,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:08:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:51,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 03:08:51,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:08:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:08:53,814 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:08:53,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:08:54,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:08:54,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:08:54,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 19 treesize of output 7 [2024-11-28 03:08:55,608 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset#2_#t~loopctr228_49| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |c_#Ultimate.C_memset#2_#ptr.base| (store (select |c_old(#memory_$Pointer$#2.base)| |c_#Ultimate.C_memset#2_#ptr.base|) (+ |v_#Ultimate.C_memset#2_#t~loopctr228_49| |c_#Ultimate.C_memset#2_#ptr.offset|) 0)) |c_#memory_$Pointer$#2.base|) (<= |v_#Ultimate.C_memset#2_#t~loopctr228_49| 0))) is different from true [2024-11-28 03:08:55,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:08:55,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2024-11-28 03:08:56,821 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:08:56,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-28 03:08:57,627 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:08:57,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:08:58,191 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:08:58,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:08:58,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:08:58,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:08:58,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 03:08:59,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:08:59,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:08:59,489 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-28 03:09:00,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:09:00,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-28 03:09:00,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-28 03:09:01,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-28 03:09:01,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-28 03:09:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:09:01,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:09:02,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:09:02,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-28 03:09:02,773 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3571 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem62#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_43 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (forall ((v_ArrVal_3572 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-28 03:09:04,608 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 1942 treesize of output 1870 [2024-11-28 03:09:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 598 [2024-11-28 03:09:04,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 598 treesize of output 582 [2024-11-28 03:09:04,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 596 treesize of output 584 [2024-11-28 03:09:04,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 574 treesize of output 566 [2024-11-28 03:09:04,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 558 [2024-11-28 03:09:05,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3571 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3568))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_47)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3568 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3568 (Array Int Int)) (v_prenex_49 (Array Int Int))) (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3568))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_49)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (or (forall ((v_ArrVal_3568 (Array Int Int)) (v_ArrVal_3569 (Array Int Int))) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3568))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3569)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_~user~0#1.base|))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| |c_ULTIMATE.start_main_~user~0#1.base|)))) is different from false [2024-11-28 03:09:05,482 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_3568 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3568 (Array Int Int)) (v_prenex_49 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3568))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_49)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3571 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3568))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_47)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse3 .cse4 v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse4))))))) is different from false [2024-11-28 03:09:05,614 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3566))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_prenex_49 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3566))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_49)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (let ((.cse4 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3566))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_47)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse4 .cse5 v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse5)))))) is different from false [2024-11-28 03:09:05,693 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_prenex_49 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3566))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_49)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3566))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (let ((.cse5 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3566))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_47)))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse5 .cse6 v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse6))))))) is different from false [2024-11-28 03:09:06,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3565))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_prenex_49 (Array Int Int))) (not (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3565))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_49)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_3565))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_47)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse7 .cse8 v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse8))))))) is different from false [2024-11-28 03:09:08,349 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_prenex_49 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_3564))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_49)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (let ((.cse6 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_3564))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_47)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse6 .cse7 v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse7)))) (forall ((v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (not (= (select (select (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_3564))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|)))))) is different from false [2024-11-28 03:09:11,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base|))) (and (forall ((|v_#Ultimate.C_memset#2_#t~loopctr228_55| Int)) (or (< 0 |v_#Ultimate.C_memset#2_#t~loopctr228_55|) (forall ((|v_#Ultimate.C_memset#2_#ptr.offset_28| Int)) (or (< |c_ULTIMATE.start_main_#t~mem54#1.offset| |v_#Ultimate.C_memset#2_#ptr.offset_28|) (forall ((v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_prenex_49 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| (store .cse6 (+ |v_#Ultimate.C_memset#2_#t~loopctr228_55| |v_#Ultimate.C_memset#2_#ptr.offset_28|) 0)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3564)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_49)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))))))) (forall ((|v_#Ultimate.C_memset#2_#t~loopctr228_55| Int)) (or (< 0 |v_#Ultimate.C_memset#2_#t~loopctr228_55|) (forall ((|v_#Ultimate.C_memset#2_#ptr.offset_28| Int)) (or (< |c_ULTIMATE.start_main_#t~mem54#1.offset| |v_#Ultimate.C_memset#2_#ptr.offset_28|) (forall ((v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (not (= (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| (store .cse6 (+ |v_#Ultimate.C_memset#2_#t~loopctr228_55| |v_#Ultimate.C_memset#2_#ptr.offset_28|) 0)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3564)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_~user~0#1.base|))))))) (forall ((|v_#Ultimate.C_memset#2_#t~loopctr228_55| Int)) (or (< 0 |v_#Ultimate.C_memset#2_#t~loopctr228_55|) (forall ((|v_#Ultimate.C_memset#2_#ptr.offset_28| Int)) (or (< |c_ULTIMATE.start_main_#t~mem54#1.offset| |v_#Ultimate.C_memset#2_#ptr.offset_28|) (forall ((v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3564 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_ArrVal_3568 (Array Int Int))) (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| (store .cse6 (+ |v_#Ultimate.C_memset#2_#t~loopctr228_55| |v_#Ultimate.C_memset#2_#ptr.offset_28|) 0)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3564)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3565)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_47)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse11 (select (select (store .cse12 .cse11 v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-28 03:09:11,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043961346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:09:11,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:09:11,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2024-11-28 03:09:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417817615] [2024-11-28 03:09:11,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:09:11,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 03:09:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:11,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 03:09:11,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1558, Unknown=32, NotChecked=792, Total=2550 [2024-11-28 03:09:11,646 INFO L87 Difference]: Start difference. First operand 1813 states and 2504 transitions. Second operand has 36 states, 33 states have (on average 6.575757575757576) internal successors, (217), 36 states have internal predecessors, (217), 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-28 03:10:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:37,222 INFO L93 Difference]: Finished difference Result 2369 states and 3291 transitions. [2024-11-28 03:10:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:10:37,222 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 6.575757575757576) internal successors, (217), 36 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-28 03:10:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:37,225 INFO L225 Difference]: With dead ends: 2369 [2024-11-28 03:10:37,225 INFO L226 Difference]: Without dead ends: 2369 [2024-11-28 03:10:37,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=369, Invalid=3055, Unknown=34, NotChecked=1098, Total=4556 [2024-11-28 03:10:37,226 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 2211 mSDsluCounter, 14794 mSDsCounter, 0 mSdLazyCounter, 9911 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 15434 SdHoareTripleChecker+Invalid, 11430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 9911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1432 IncrementalHoareTripleChecker+Unchecked, 79.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:37,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 15434 Invalid, 11430 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 9911 Invalid, 0 Unknown, 1432 Unchecked, 79.6s Time] [2024-11-28 03:10:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2024-11-28 03:10:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1765. [2024-11-28 03:10:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1465 states have (on average 1.6389078498293514) internal successors, (2401), 1755 states have internal predecessors, (2401), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:10:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2453 transitions. [2024-11-28 03:10:37,252 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2453 transitions. Word has length 113 [2024-11-28 03:10:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:37,253 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2453 transitions. [2024-11-28 03:10:37,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 6.575757575757576) internal successors, (217), 36 states have internal predecessors, (217), 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-28 03:10:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2453 transitions. [2024-11-28 03:10:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 03:10:37,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:37,254 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, 1, 1, 1, 1, 1] [2024-11-28 03:10:37,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 03:10:37,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-28 03:10:37,455 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:10:37,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash -502821651, now seen corresponding path program 1 times [2024-11-28 03:10:37,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:37,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16331489] [2024-11-28 03:10:37,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:37,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:37,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16331489] [2024-11-28 03:10:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16331489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:37,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:37,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:10:37,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540328409] [2024-11-28 03:10:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:37,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:10:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:37,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:10:37,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:10:37,721 INFO L87 Difference]: Start difference. First operand 1765 states and 2453 transitions. Second operand has 5 states, 4 states have (on average 28.25) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:10:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:43,993 INFO L93 Difference]: Finished difference Result 1764 states and 2451 transitions. [2024-11-28 03:10:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:10:43,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.25) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-28 03:10:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:43,996 INFO L225 Difference]: With dead ends: 1764 [2024-11-28 03:10:43,996 INFO L226 Difference]: Without dead ends: 1764 [2024-11-28 03:10:43,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:10:43,997 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 5 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:43,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3085 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-28 03:10:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-11-28 03:10:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2024-11-28 03:10:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1465 states have (on average 1.637542662116041) internal successors, (2399), 1754 states have internal predecessors, (2399), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:10:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2451 transitions. [2024-11-28 03:10:44,012 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2451 transitions. Word has length 115 [2024-11-28 03:10:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:44,012 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2451 transitions. [2024-11-28 03:10:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.25) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:10:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2451 transitions. [2024-11-28 03:10:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 03:10:44,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:44,013 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, 1, 1, 1, 1, 1] [2024-11-28 03:10:44,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 03:10:44,013 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:10:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash -502821650, now seen corresponding path program 1 times [2024-11-28 03:10:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881138921] [2024-11-28 03:10:44,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:47,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881138921] [2024-11-28 03:10:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881138921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 03:10:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435351490] [2024-11-28 03:10:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:47,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:10:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:47,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:10:47,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:10:47,846 INFO L87 Difference]: Start difference. First operand 1764 states and 2451 transitions. Second operand has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:11:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:11:20,088 INFO L93 Difference]: Finished difference Result 1846 states and 2550 transitions. [2024-11-28 03:11:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:11:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-28 03:11:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:11:20,090 INFO L225 Difference]: With dead ends: 1846 [2024-11-28 03:11:20,090 INFO L226 Difference]: Without dead ends: 1846 [2024-11-28 03:11:20,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-28 03:11:20,091 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 969 mSDsluCounter, 5333 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 5965 SdHoareTripleChecker+Invalid, 3989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:11:20,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 5965 Invalid, 3989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 30.3s Time] [2024-11-28 03:11:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-28 03:11:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1817. [2024-11-28 03:11:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1517 states have (on average 1.6163480553724456) internal successors, (2452), 1805 states have internal predecessors, (2452), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-28 03:11:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2506 transitions. [2024-11-28 03:11:20,118 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2506 transitions. Word has length 115 [2024-11-28 03:11:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:11:20,118 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2506 transitions. [2024-11-28 03:11:20,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:11:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2506 transitions. [2024-11-28 03:11:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 03:11:20,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:11:20,119 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, 1, 1, 1, 1, 1, 1] [2024-11-28 03:11:20,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-28 03:11:20,119 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:11:20,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:11:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash 931118810, now seen corresponding path program 1 times [2024-11-28 03:11:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:11:20,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219452333] [2024-11-28 03:11:20,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:11:20,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:11:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:11:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:11:20,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:11:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219452333] [2024-11-28 03:11:20,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219452333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:11:20,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:11:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:11:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456482326] [2024-11-28 03:11:20,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:11:20,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:11:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:11:20,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:11:20,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:11:20,565 INFO L87 Difference]: Start difference. First operand 1817 states and 2506 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:11:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:11:27,455 INFO L93 Difference]: Finished difference Result 1816 states and 2504 transitions. [2024-11-28 03:11:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:11:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-28 03:11:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:11:27,457 INFO L225 Difference]: With dead ends: 1816 [2024-11-28 03:11:27,457 INFO L226 Difference]: Without dead ends: 1816 [2024-11-28 03:11:27,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:11:27,458 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 4 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:11:27,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3051 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-28 03:11:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-28 03:11:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1763. [2024-11-28 03:11:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1465 states have (on average 1.6361774744027304) internal successors, (2397), 1753 states have internal predecessors, (2397), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:11:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2449 transitions. [2024-11-28 03:11:27,483 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2449 transitions. Word has length 116 [2024-11-28 03:11:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:11:27,483 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 2449 transitions. [2024-11-28 03:11:27,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:11:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2449 transitions. [2024-11-28 03:11:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 03:11:27,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:11:27,485 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, 1, 1, 1, 1, 1, 1] [2024-11-28 03:11:27,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 03:11:27,485 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:11:27,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:11:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1592398717, now seen corresponding path program 1 times [2024-11-28 03:11:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:11:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549499896] [2024-11-28 03:11:27,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:11:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:11:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:11:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:11:31,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:11:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549499896] [2024-11-28 03:11:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549499896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:11:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:11:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:11:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916474202] [2024-11-28 03:11:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:11:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:11:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:11:31,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:11:31,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:11:31,864 INFO L87 Difference]: Start difference. First operand 1763 states and 2449 transitions. Second operand has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:12:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:12:13,620 INFO L93 Difference]: Finished difference Result 1846 states and 2548 transitions. [2024-11-28 03:12:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:12:13,621 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-28 03:12:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:12:13,623 INFO L225 Difference]: With dead ends: 1846 [2024-11-28 03:12:13,623 INFO L226 Difference]: Without dead ends: 1846 [2024-11-28 03:12:13,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 03:12:13,624 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 949 mSDsluCounter, 8003 mSDsCounter, 0 mSdLazyCounter, 5078 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 8637 SdHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:12:13,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 8637 Invalid, 5102 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 5078 Invalid, 0 Unknown, 0 Unchecked, 39.4s Time] [2024-11-28 03:12:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-28 03:12:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1818. [2024-11-28 03:12:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1519 states have (on average 1.6142198815009874) internal successors, (2452), 1806 states have internal predecessors, (2452), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 11 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 03:12:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2510 transitions. [2024-11-28 03:12:13,643 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2510 transitions. Word has length 116 [2024-11-28 03:12:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:12:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2510 transitions. [2024-11-28 03:12:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:12:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2510 transitions. [2024-11-28 03:12:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 03:12:13,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:12:13,645 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, 1, 1, 1, 1, 1, 1] [2024-11-28 03:12:13,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 03:12:13,645 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:12:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:12:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1592398718, now seen corresponding path program 1 times [2024-11-28 03:12:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:12:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76128983] [2024-11-28 03:12:13,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:12:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:12:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:12:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:12:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:12:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76128983] [2024-11-28 03:12:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76128983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:12:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:12:17,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:12:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394628290] [2024-11-28 03:12:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:12:17,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:12:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:12:17,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:12:17,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:12:17,644 INFO L87 Difference]: Start difference. First operand 1818 states and 2510 transitions. Second operand has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:13:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:06,779 INFO L93 Difference]: Finished difference Result 1845 states and 2546 transitions. [2024-11-28 03:13:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:13:06,780 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-28 03:13:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:06,783 INFO L225 Difference]: With dead ends: 1845 [2024-11-28 03:13:06,783 INFO L226 Difference]: Without dead ends: 1845 [2024-11-28 03:13:06,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 03:13:06,784 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 928 mSDsluCounter, 8115 mSDsCounter, 0 mSdLazyCounter, 5871 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 8750 SdHoareTripleChecker+Invalid, 5895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:06,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 8750 Invalid, 5895 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 5871 Invalid, 0 Unknown, 0 Unchecked, 46.7s Time] [2024-11-28 03:13:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-11-28 03:13:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1818. [2024-11-28 03:13:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1517 states have (on average 1.6150296638101516) internal successors, (2450), 1806 states have internal predecessors, (2450), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 11 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 03:13:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2508 transitions. [2024-11-28 03:13:06,811 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2508 transitions. Word has length 116 [2024-11-28 03:13:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:06,811 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2508 transitions. [2024-11-28 03:13:06,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:13:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2508 transitions. [2024-11-28 03:13:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 03:13:06,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:06,813 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:13:06,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 03:13:06,813 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:13:06,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1200087279, now seen corresponding path program 1 times [2024-11-28 03:13:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935090332] [2024-11-28 03:13:06,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935090332] [2024-11-28 03:13:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935090332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:13:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058451116] [2024-11-28 03:13:12,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:12,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:13:12,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:13:12,280 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:13:12,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 03:13:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:12,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 03:13:12,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:13:12,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:13:14,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:13:14,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:13:14,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:13:14,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:13:15,235 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:13:15,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:13:15,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 03:13:15,738 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:13:15,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:13:15,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 03:13:16,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:13:16,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:13:16,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 03:13:16,764 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:13:16,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:13:16,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 03:13:17,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:13:17,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:13:17,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 03:13:17,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:13:18,622 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 03:13:18,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-28 03:13:18,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-28 03:13:19,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:13:19,744 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 03:13:19,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-28 03:13:19,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-28 03:13:20,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-28 03:13:20,860 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 03:13:20,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-28 03:13:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:20,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:13:21,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4294))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (not (= v_ArrVal_4294 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) .cse2 (select v_ArrVal_4294 .cse2))))))) is different from false [2024-11-28 03:13:21,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4294 (Array Int Int))) (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))) (or (not (= v_ArrVal_4294 (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select |c_#memory_$Pointer$#2.base| .cse0) .cse1 (select v_ArrVal_4294 .cse1))))) (= (select |c_#valid| (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4294))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-28 03:13:21,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4293 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4293)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select |c_#valid| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4294))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4294 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4294 .cse5))))))))) is different from false [2024-11-28 03:13:21,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 184 [2024-11-28 03:13:21,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4293 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_14|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4293)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4294))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4294 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4294 .cse5))))))))) is different from false [2024-11-28 03:13:22,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4294 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse6 (store (select |c_#memory_$Pointer$#2.base| .cse6) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse6 v_ArrVal_4293)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4294 .cse4))) v_ArrVal_4294)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4294))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|))))))) is different from false [2024-11-28 03:13:22,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4294 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4289)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4290))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4293)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4294 .cse4))) v_ArrVal_4294)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4294))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-28 03:13:22,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4294 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4290))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4293)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4294))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4294 .cse5))) v_ArrVal_4294)))))))))) is different from false [2024-11-28 03:13:23,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4294 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4287)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4288) .cse9 v_ArrVal_4290))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4293))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4294 .cse2))) v_ArrVal_4294)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4294))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-28 03:13:23,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4294 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4287))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4288) .cse10 v_ArrVal_4290))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4293)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4294))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4294 .cse5))) v_ArrVal_4294)))))))))))) is different from false [2024-11-28 03:13:23,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4294 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4285)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4287))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4286) .cse9 v_ArrVal_4288) .cse10 v_ArrVal_4290))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4293))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4294 .cse2))) v_ArrVal_4294)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4294))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-28 03:13:24,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4294 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4285))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4287))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4286) .cse10 v_ArrVal_4288) .cse11 v_ArrVal_4290))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4293)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4294))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4294 .cse5))) v_ArrVal_4294)))))))))))))) is different from false [2024-11-28 03:13:24,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4294 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4283)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4285))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4287))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4284) .cse9 v_ArrVal_4286) .cse10 v_ArrVal_4288) .cse11 v_ArrVal_4290))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4293))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4294))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4294 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4294 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-28 03:13:24,694 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4294 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4283))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4285))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4287))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4284) .cse10 v_ArrVal_4286) .cse11 v_ArrVal_4288) .cse12 v_ArrVal_4290))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4293)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4294))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4294 .cse5))) v_ArrVal_4294)))))))))))))))) is different from false [2024-11-28 03:13:25,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4293 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4294 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4300 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4301 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4300)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4283))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4285))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4287))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4301) .cse9 v_ArrVal_4284) .cse10 v_ArrVal_4286) .cse11 v_ArrVal_4288) .cse12 v_ArrVal_4290))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4293))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4294 .cse2))) v_ArrVal_4294)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4294))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-28 03:13:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058451116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:13:25,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:13:25,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2024-11-28 03:13:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841662613] [2024-11-28 03:13:25,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:13:25,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 03:13:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:25,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 03:13:25,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1023, Unknown=14, NotChecked=1078, Total=2256 [2024-11-28 03:13:25,435 INFO L87 Difference]: Start difference. First operand 1818 states and 2508 transitions. Second operand has 34 states, 31 states have (on average 6.064516129032258) internal successors, (188), 34 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:14:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:14:05,292 INFO L93 Difference]: Finished difference Result 1842 states and 2542 transitions. [2024-11-28 03:14:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:14:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 6.064516129032258) internal successors, (188), 34 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2024-11-28 03:14:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:14:05,295 INFO L225 Difference]: With dead ends: 1842 [2024-11-28 03:14:05,295 INFO L226 Difference]: Without dead ends: 1842 [2024-11-28 03:14:05,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=270, Invalid=2124, Unknown=14, NotChecked=1498, Total=3906 [2024-11-28 03:14:05,296 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 966 mSDsluCounter, 6883 mSDsCounter, 0 mSdLazyCounter, 4606 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 7517 SdHoareTripleChecker+Invalid, 4637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:14:05,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 7517 Invalid, 4637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 4606 Invalid, 0 Unknown, 0 Unchecked, 36.0s Time] [2024-11-28 03:14:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2024-11-28 03:14:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1817. [2024-11-28 03:14:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1517 states have (on average 1.6137112722478577) internal successors, (2448), 1805 states have internal predecessors, (2448), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 11 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-28 03:14:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2506 transitions. [2024-11-28 03:14:05,314 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2506 transitions. Word has length 117 [2024-11-28 03:14:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:14:05,314 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2506 transitions. [2024-11-28 03:14:05,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 6.064516129032258) internal successors, (188), 34 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:14:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2506 transitions. [2024-11-28 03:14:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 03:14:05,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:14:05,315 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:14:05,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 03:14:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-28 03:14:05,515 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:14:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1200087278, now seen corresponding path program 1 times [2024-11-28 03:14:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190461670] [2024-11-28 03:14:05,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:14:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:14:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:10,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190461670] [2024-11-28 03:14:10,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190461670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:14:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347120913] [2024-11-28 03:14:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:14:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:14:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:14:10,648 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:14:10,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 03:14:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:14:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 03:14:11,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:14:11,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:14:12,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:14:12,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:14:12,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:14:13,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:14:13,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:14:14,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:14:14,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:14:14,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:14:14,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:14:15,129 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:14:15,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:14:15,601 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:14:15,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:14:16,086 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-28 03:14:16,627 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 03:14:16,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-28 03:14:16,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-28 03:14:17,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:14:17,773 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 03:14:17,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-28 03:14:17,897 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-28 03:14:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-28 03:14:19,159 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 03:14:19,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-28 03:14:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:19,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:14:21,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse3 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (and (forall ((v_ArrVal_4521 (Array Int Int))) (or (forall ((v_ArrVal_4520 (Array Int Int))) (or (< 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4521))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= v_ArrVal_4520 (store .cse2 .cse3 (select v_ArrVal_4520 .cse3)))))) (not (= (store .cse4 .cse3 (select v_ArrVal_4521 .cse3)) v_ArrVal_4521)))) (forall ((v_ArrVal_4521 (Array Int Int))) (or (forall ((v_ArrVal_4520 (Array Int Int))) (or (not (= v_ArrVal_4520 (store .cse2 .cse3 (select v_ArrVal_4520 .cse3)))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4521)) (.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4520))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 383 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))) (not (= (store .cse4 .cse3 (select v_ArrVal_4521 .cse3)) v_ArrVal_4521)))))) is different from false [2024-11-28 03:14:21,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse1 (select |c_#memory_$Pointer$#2.offset| .cse8)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_16| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_16| .cse0) (forall ((v_ArrVal_4521 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_16| 40))) (or (not (= v_ArrVal_4521 (store .cse1 .cse2 (select v_ArrVal_4521 .cse2)))) (forall ((v_ArrVal_4520 (Array Int Int))) (or (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_4521)) (.cse6 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_4520))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (< (+ 383 (select (select .cse3 .cse4) .cse5)) (select |c_#length| (select (select .cse6 .cse4) .cse5))))) (not (= v_ArrVal_4520 (store .cse9 .cse2 (select v_ArrVal_4520 .cse2))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_16| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_16| .cse0) (forall ((v_ArrVal_4521 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_16| 40))) (or (not (= v_ArrVal_4521 (store .cse1 .cse10 (select v_ArrVal_4521 .cse10)))) (forall ((v_ArrVal_4520 (Array Int Int))) (or (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_4521))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_4520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) 1)) (not (= v_ArrVal_4520 (store .cse9 .cse10 (select v_ArrVal_4520 .cse10))))))))))))))) is different from false [2024-11-28 03:14:26,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.offset|)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse9 (select .cse6 .cse7)) (.cse11 (select .cse8 .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_16| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_16| .cse0) (forall ((v_ArrVal_4521 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_16| 40))) (or (forall ((v_ArrVal_4520 (Array Int Int))) (or (let ((.cse1 (store .cse8 .cse7 v_ArrVal_4521)) (.cse4 (store .cse6 .cse7 v_ArrVal_4520))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ 383 (select (select .cse1 .cse2) .cse3)) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_4520 (store .cse9 .cse10 (select v_ArrVal_4520 .cse10)))))) (not (= (store .cse11 .cse10 (select v_ArrVal_4521 .cse10)) v_ArrVal_4521))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_16| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_16| .cse0) (forall ((v_ArrVal_4521 (Array Int Int))) (let ((.cse12 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_16| 40))) (or (forall ((v_ArrVal_4520 (Array Int Int))) (or (not (= v_ArrVal_4520 (store .cse9 .cse12 (select v_ArrVal_4520 .cse12)))) (< 0 (+ (let ((.cse13 (store .cse8 .cse7 v_ArrVal_4521))) (select (select .cse13 (select (select (store .cse6 .cse7 v_ArrVal_4520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))) (not (= (store .cse11 .cse12 (select v_ArrVal_4521 .cse12)) v_ArrVal_4521))))))))))) is different from false [2024-11-28 03:14:27,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 757 treesize of output 664 [2024-11-28 03:14:29,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((v_ArrVal_4520 (Array Int Int)) (v_ArrVal_4521 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_16| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_16| 40)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4521 .cse2)) v_ArrVal_4521)) (not (= v_ArrVal_4520 (store (select .cse3 .cse1) .cse2 (select v_ArrVal_4520 .cse2)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_16| .cse4) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_17| (select (let ((.cse5 (store .cse3 .cse1 v_ArrVal_4520))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse0 .cse1 v_ArrVal_4521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))) (forall ((v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_prenex_65 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse10 (+ 40 v_prenex_65))) (or (not (= (store (select .cse8 .cse9) .cse10 (select v_prenex_63 .cse10)) v_prenex_63)) (< v_prenex_65 .cse4) (< 0 (+ (let ((.cse11 (store .cse0 .cse9 v_prenex_64))) (select (select .cse11 (select (select (store .cse8 .cse9 v_prenex_63) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)) (not (= (store (select .cse0 .cse9) .cse10 (select v_prenex_64 .cse10)) v_prenex_64)))))) (forall ((v_ArrVal_4520 (Array Int Int)) (v_ArrVal_4521 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_16| Int)) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse15 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_16| 40))) (or (< (let ((.cse12 (store .cse0 .cse14 v_ArrVal_4521))) (select (select .cse12 (select (select (store .cse13 .cse14 v_ArrVal_4520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (select .cse0 .cse14) .cse15 (select v_ArrVal_4521 .cse15)) v_ArrVal_4521)) (not (= v_ArrVal_4520 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4520 .cse15)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_16| .cse4)))))))) is different from false [2024-11-28 03:14:29,601 INFO L349 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2024-11-28 03:14:29,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 406 treesize of output 314 [2024-11-28 03:14:29,800 INFO L224 Elim1Store]: Index analysis took 127 ms [2024-11-28 03:14:30,395 INFO L349 Elim1Store]: treesize reduction 113, result has 63.5 percent of original size [2024-11-28 03:14:30,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 643 treesize of output 683 [2024-11-28 03:14:33,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-11-28 03:14:33,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:14:38,019 INFO L349 Elim1Store]: treesize reduction 42, result has 76.8 percent of original size [2024-11-28 03:14:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 489 treesize of output 559 [2024-11-28 03:14:41,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:14:41,742 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-28 03:14:41,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 360 treesize of output 1 [2024-11-28 03:14:41,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:14:41,774 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-28 03:14:41,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 358 treesize of output 1 [2024-11-28 03:14:41,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4516 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4516) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-28 03:14:44,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4513 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (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_4513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-28 03:14:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347120913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:14:45,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:14:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2024-11-28 03:14:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195756933] [2024-11-28 03:14:45,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:14:45,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-28 03:14:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:45,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-28 03:14:45,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1727, Unknown=26, NotChecked=534, Total=2450 [2024-11-28 03:14:45,386 INFO L87 Difference]: Start difference. First operand 1817 states and 2506 transitions. Second operand has 37 states, 34 states have (on average 5.705882352941177) internal successors, (194), 37 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:15:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:59,648 INFO L93 Difference]: Finished difference Result 1841 states and 2540 transitions. [2024-11-28 03:15:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:15:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 5.705882352941177) internal successors, (194), 37 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2024-11-28 03:15:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:59,652 INFO L225 Difference]: With dead ends: 1841 [2024-11-28 03:15:59,652 INFO L226 Difference]: Without dead ends: 1841 [2024-11-28 03:15:59,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=306, Invalid=3114, Unknown=26, NotChecked=714, Total=4160 [2024-11-28 03:15:59,653 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 901 mSDsluCounter, 7869 mSDsCounter, 0 mSdLazyCounter, 6561 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 8500 SdHoareTripleChecker+Invalid, 6599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 6561 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:59,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 8500 Invalid, 6599 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 6561 Invalid, 2 Unknown, 0 Unchecked, 68.1s Time] [2024-11-28 03:15:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2024-11-28 03:15:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1761. [2024-11-28 03:15:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1463 states have (on average 1.6356801093643198) internal successors, (2393), 1751 states have internal predecessors, (2393), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:15:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2445 transitions. [2024-11-28 03:15:59,676 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2445 transitions. Word has length 117 [2024-11-28 03:15:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:59,677 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2445 transitions. [2024-11-28 03:15:59,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 5.705882352941177) internal successors, (194), 37 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:15:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2445 transitions. [2024-11-28 03:15:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 03:15:59,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:59,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:59,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 03:15:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-28 03:15:59,879 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:15:59,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash 636736647, now seen corresponding path program 1 times [2024-11-28 03:15:59,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:59,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234584620] [2024-11-28 03:15:59,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:16:00,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:16:00,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234584620] [2024-11-28 03:16:00,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234584620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:16:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:16:00,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:16:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346807591] [2024-11-28 03:16:00,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:16:00,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:16:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:00,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:16:00,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:16:00,172 INFO L87 Difference]: Start difference. First operand 1761 states and 2445 transitions. Second operand has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:16:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:07,237 INFO L93 Difference]: Finished difference Result 2272 states and 3166 transitions. [2024-11-28 03:16:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:16:07,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 126 [2024-11-28 03:16:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:07,241 INFO L225 Difference]: With dead ends: 2272 [2024-11-28 03:16:07,241 INFO L226 Difference]: Without dead ends: 2272 [2024-11-28 03:16:07,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:16:07,242 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 2017 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:07,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 1190 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-28 03:16:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-11-28 03:16:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2022. [2024-11-28 03:16:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1735 states have (on average 1.6097982708933718) internal successors, (2793), 2012 states have internal predecessors, (2793), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:16:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2845 transitions. [2024-11-28 03:16:07,272 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2845 transitions. Word has length 126 [2024-11-28 03:16:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:07,272 INFO L471 AbstractCegarLoop]: Abstraction has 2022 states and 2845 transitions. [2024-11-28 03:16:07,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:16:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2845 transitions. [2024-11-28 03:16:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 03:16:07,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:07,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:16:07,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-28 03:16:07,274 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:16:07,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:16:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash 636736648, now seen corresponding path program 1 times [2024-11-28 03:16:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:16:07,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4604880] [2024-11-28 03:16:07,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:16:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:16:07,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:16:07,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4604880] [2024-11-28 03:16:07,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4604880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:16:07,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:16:07,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:16:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429614041] [2024-11-28 03:16:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:16:07,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:16:07,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:07,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:16:07,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:16:07,921 INFO L87 Difference]: Start difference. First operand 2022 states and 2845 transitions. Second operand has 5 states, 4 states have (on average 29.5) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:16:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:17,189 INFO L93 Difference]: Finished difference Result 2720 states and 3781 transitions. [2024-11-28 03:16:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:16:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.5) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 126 [2024-11-28 03:16:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:17,193 INFO L225 Difference]: With dead ends: 2720 [2024-11-28 03:16:17,193 INFO L226 Difference]: Without dead ends: 2720 [2024-11-28 03:16:17,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:16:17,194 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 3333 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3340 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:17,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3340 Valid, 1349 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-28 03:16:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2024-11-28 03:16:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2397. [2024-11-28 03:16:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2127 states have (on average 1.5942642219087917) internal successors, (3391), 2387 states have internal predecessors, (3391), 32 states have call successors, (32), 4 states have call predecessors, (32), 3 states have return successors, (30), 10 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-28 03:16:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3453 transitions. [2024-11-28 03:16:17,232 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3453 transitions. Word has length 126 [2024-11-28 03:16:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:17,233 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3453 transitions. [2024-11-28 03:16:17,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.5) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:16:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3453 transitions. [2024-11-28 03:16:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 03:16:17,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:17,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:16:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-28 03:16:17,235 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:16:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:16:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1735999631, now seen corresponding path program 1 times [2024-11-28 03:16:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:16:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276695754] [2024-11-28 03:16:17,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:16:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:16:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:16:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276695754] [2024-11-28 03:16:17,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276695754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:16:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776207046] [2024-11-28 03:16:17,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:17,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:16:17,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:16:17,812 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:16:17,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 03:16:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:18,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 03:16:18,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:16:18,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:16:20,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:16:20,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:16:20,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:16:21,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:16:21,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 31 treesize of output 32 [2024-11-28 03:16:21,527 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:16:21,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:16:21,993 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:16:21,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:16:22,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:16:22,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:16:22,891 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:16:22,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:16:23,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:16:23,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:16:24,083 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-28 03:16:25,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 31 treesize of output 13 [2024-11-28 03:16:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:16:25,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:16:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776207046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:16:25,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:16:25,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4] total 18 [2024-11-28 03:16:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065137661] [2024-11-28 03:16:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:16:25,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:16:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:25,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:16:25,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:16:25,536 INFO L87 Difference]: Start difference. First operand 2397 states and 3453 transitions. Second operand has 16 states, 15 states have (on average 8.2) internal successors, (123), 16 states have internal predecessors, (123), 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-28 03:16:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:59,878 INFO L93 Difference]: Finished difference Result 2472 states and 3537 transitions. [2024-11-28 03:16:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:16:59,879 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.2) internal successors, (123), 16 states have internal predecessors, (123), 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 127 [2024-11-28 03:16:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:59,882 INFO L225 Difference]: With dead ends: 2472 [2024-11-28 03:16:59,882 INFO L226 Difference]: Without dead ends: 2472 [2024-11-28 03:16:59,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:16:59,883 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 894 mSDsluCounter, 4944 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 5568 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:59,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 5568 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 31.9s Time] [2024-11-28 03:16:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2024-11-28 03:16:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2466. [2024-11-28 03:16:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2193 states have (on average 1.5768353853169175) internal successors, (3458), 2452 states have internal predecessors, (3458), 34 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (39), 14 states have call predecessors, (39), 32 states have call successors, (39) [2024-11-28 03:16:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3531 transitions. [2024-11-28 03:16:59,913 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3531 transitions. Word has length 127 [2024-11-28 03:16:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:59,914 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3531 transitions. [2024-11-28 03:16:59,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.2) internal successors, (123), 16 states have internal predecessors, (123), 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-28 03:16:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3531 transitions. [2024-11-28 03:16:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 03:16:59,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:59,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:16:59,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 03:17:00,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-28 03:17:00,116 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-28 03:17:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1735999630, now seen corresponding path program 1 times [2024-11-28 03:17:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452701323] [2024-11-28 03:17:00,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:17:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452701323] [2024-11-28 03:17:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452701323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507279966] [2024-11-28 03:17:00,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:00,595 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:00,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14fb7c73-cfce-4e06-b820-dabb14a5e520/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 03:17:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:01,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 03:17:01,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:01,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:17:02,923 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:17:02,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:17:03,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:17:03,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:17:04,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:17:04,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:17:04,496 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-28 03:17:04,989 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:17:04,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:17:05,033 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-28 03:17:05,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:17:05,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:17:05,565 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-28 03:17:06,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:17:06,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 51 treesize of output 48 [2024-11-28 03:17:06,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-28 03:17:06,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:17:06,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:17:06,866 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-28 03:17:07,512 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:17:07,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-28 03:17:07,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-28 03:17:08,415 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 30 treesize of output 18 [2024-11-28 03:17:08,441 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 23 treesize of output 11 [2024-11-28 03:17:09,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-28 03:17:09,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-28 03:17:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:10,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:17:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507279966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:17:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4] total 18 [2024-11-28 03:17:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795975211] [2024-11-28 03:17:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:10,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:17:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:17:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:17:10,201 INFO L87 Difference]: Start difference. First operand 2466 states and 3531 transitions. Second operand has 16 states, 15 states have (on average 8.2) internal successors, (123), 16 states have internal predecessors, (123), 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)