./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/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_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/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 64bit --witnessprinter.graph.data.programhash d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:47:16,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:47:16,949 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 02:47:16,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:47:16,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:47:16,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:47:16,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:47:16,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:47:16,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:47:16,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:47:16,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:47:16,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:47:17,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:47:17,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:47:17,001 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:47:17,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:47:17,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:47:17,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:47:17,002 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:47:17,003 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:47:17,003 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:47:17,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:47:17,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:47:17,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:47:17,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:47:17,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:47:17,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:47:17,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:47:17,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:47:17,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:47:17,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:17,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:47:17,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:47:17,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:47:17,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:47:17,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:17,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:47:17,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:47:17,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:47:17,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:47:17,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:47:17,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:47:17,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:47:17,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:47:17,007 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_2c229d90-1366-4564-8aac-b9b94e58f039/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc [2024-11-28 02:47:17,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:47:17,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:47:17,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:47:17,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:47:17,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:47:17,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-28 02:47:20,711 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/data/d8089736e/5fc57c05d62a453d8f713c954ff0725d/FLAG876aef2fa [2024-11-28 02:47:21,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:47:21,126 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-28 02:47:21,156 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/data/d8089736e/5fc57c05d62a453d8f713c954ff0725d/FLAG876aef2fa [2024-11-28 02:47:21,282 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/data/d8089736e/5fc57c05d62a453d8f713c954ff0725d [2024-11-28 02:47:21,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:47:21,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:47:21,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:47:21,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:47:21,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:47:21,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192bba87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21, skipping insertion in model container [2024-11-28 02:47:21,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:47:21,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:47:21,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:47:21,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:47:21,881 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:47:21,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21 WrapperNode [2024-11-28 02:47:21,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:47:21,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:47:21,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:47:21,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:47:21,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,939 INFO L138 Inliner]: procedures = 121, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-11-28 02:47:21,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:47:21,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:47:21,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:47:21,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:47:21,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,993 INFO L175 MemorySlicer]: Split 20 memory accesses to 1 slices as follows [20]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-11-28 02:47:21,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:21,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:22,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:22,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:22,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:22,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:22,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:22,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:47:22,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:47:22,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:47:22,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:47:22,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (1/1) ... [2024-11-28 02:47:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:22,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:22,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:47:22,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:47:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:47:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-28 02:47:22,129 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-28 02:47:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:47:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:47:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:47:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:47:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:47:22,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:47:22,309 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:47:22,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:47:22,986 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-28 02:47:22,986 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:47:23,012 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:47:23,012 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 02:47:23,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:23 BoogieIcfgContainer [2024-11-28 02:47:23,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:47:23,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:47:23,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:47:23,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:47:23,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:21" (1/3) ... [2024-11-28 02:47:23,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c0ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:23, skipping insertion in model container [2024-11-28 02:47:23,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:21" (2/3) ... [2024-11-28 02:47:23,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c0ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:23, skipping insertion in model container [2024-11-28 02:47:23,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:23" (3/3) ... [2024-11-28 02:47:23,033 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-middle-shared.i [2024-11-28 02:47:23,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:47:23,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-middle-shared.i that has 2 procedures, 111 locations, 1 initial locations, 3 loop locations, and 50 error locations. [2024-11-28 02:47:23,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:47:23,141 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;@2d807688, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:47:23,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-28 02:47:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 57 states have (on average 2.0) internal successors, (114), 107 states have internal predecessors, (114), 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 02:47:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 02:47:23,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:23,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 02:47:23,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash 37412693, now seen corresponding path program 1 times [2024-11-28 02:47:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:23,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232770625] [2024-11-28 02:47:23,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:23,473 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 02:47:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232770625] [2024-11-28 02:47:23,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232770625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:23,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:23,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340125872] [2024-11-28 02:47:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:23,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:23,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:23,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:23,515 INFO L87 Difference]: Start difference. First operand has 111 states, 57 states have (on average 2.0) internal successors, (114), 107 states have internal predecessors, (114), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:47:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:23,707 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2024-11-28 02:47:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:23,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-28 02:47:23,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:23,721 INFO L225 Difference]: With dead ends: 109 [2024-11-28 02:47:23,721 INFO L226 Difference]: Without dead ends: 107 [2024-11-28 02:47:23,723 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 02:47:23,731 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:23,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 167 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:47:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-28 02:47:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-28 02:47:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 103 states have internal predecessors, (107), 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 02:47:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2024-11-28 02:47:23,794 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 5 [2024-11-28 02:47:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:23,794 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2024-11-28 02:47:23,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:47:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2024-11-28 02:47:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 02:47:23,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:23,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 02:47:23,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:47:23,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 37412694, now seen corresponding path program 1 times [2024-11-28 02:47:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041466461] [2024-11-28 02:47:23,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:23,992 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 02:47:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:23,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041466461] [2024-11-28 02:47:23,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041466461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:23,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871886011] [2024-11-28 02:47:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:23,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:23,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:23,995 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:47:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:24,109 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2024-11-28 02:47:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:24,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-28 02:47:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:24,111 INFO L225 Difference]: With dead ends: 105 [2024-11-28 02:47:24,111 INFO L226 Difference]: Without dead ends: 105 [2024-11-28 02:47:24,112 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 02:47:24,113 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:24,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:47:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-28 02:47:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-28 02:47:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 56 states have (on average 1.875) internal successors, (105), 101 states have internal predecessors, (105), 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 02:47:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2024-11-28 02:47:24,124 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 5 [2024-11-28 02:47:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:24,124 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2024-11-28 02:47:24,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:47:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2024-11-28 02:47:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 02:47:24,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:24,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:24,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:47:24,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:24,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -551619895, now seen corresponding path program 1 times [2024-11-28 02:47:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:24,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266525588] [2024-11-28 02:47:24,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:24,336 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 02:47:24,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:24,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266525588] [2024-11-28 02:47:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266525588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:24,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:24,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595187722] [2024-11-28 02:47:24,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:24,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:24,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:24,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:24,340 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 02:47:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:24,480 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2024-11-28 02:47:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:24,481 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), 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 11 [2024-11-28 02:47:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:24,484 INFO L225 Difference]: With dead ends: 109 [2024-11-28 02:47:24,484 INFO L226 Difference]: Without dead ends: 109 [2024-11-28 02:47:24,485 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 02:47:24,486 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:24,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 158 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:47:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-28 02:47:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2024-11-28 02:47:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 100 states have internal predecessors, (104), 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 02:47:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-11-28 02:47:24,499 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 11 [2024-11-28 02:47:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:24,500 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-11-28 02:47:24,500 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), 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 02:47:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-11-28 02:47:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 02:47:24,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:24,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:24,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:47:24,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash -551619896, now seen corresponding path program 1 times [2024-11-28 02:47:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:24,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511740540] [2024-11-28 02:47:24,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:24,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:24,604 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 02:47:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511740540] [2024-11-28 02:47:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511740540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:24,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:24,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963203726] [2024-11-28 02:47:24,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:24,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:24,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:24,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:24,611 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 02:47:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:24,760 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2024-11-28 02:47:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:24,760 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), 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 11 [2024-11-28 02:47:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:24,763 INFO L225 Difference]: With dead ends: 108 [2024-11-28 02:47:24,763 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 02:47:24,763 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 02:47:24,764 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:24,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 150 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:47:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 02:47:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2024-11-28 02:47:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 99 states have internal predecessors, (103), 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 02:47:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2024-11-28 02:47:24,775 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 11 [2024-11-28 02:47:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:24,775 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2024-11-28 02:47:24,776 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), 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 02:47:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2024-11-28 02:47:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 02:47:24,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:24,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:24,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:47:24,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:24,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1825743063, now seen corresponding path program 1 times [2024-11-28 02:47:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919394976] [2024-11-28 02:47:24,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:24,996 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 02:47:24,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919394976] [2024-11-28 02:47:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919394976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989056591] [2024-11-28 02:47:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:24,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:24,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:24,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:25,001 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 02:47:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:25,131 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2024-11-28 02:47:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-28 02:47:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:25,133 INFO L225 Difference]: With dead ends: 107 [2024-11-28 02:47:25,133 INFO L226 Difference]: Without dead ends: 107 [2024-11-28 02:47:25,133 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 02:47:25,134 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:25,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:47:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-28 02:47:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2024-11-28 02:47:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 98 states have internal predecessors, (102), 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 02:47:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-28 02:47:25,156 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 13 [2024-11-28 02:47:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:25,157 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-28 02:47:25,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 02:47:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-28 02:47:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 02:47:25,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:25,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:25,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:47:25,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:25,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1825743062, now seen corresponding path program 1 times [2024-11-28 02:47:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356365825] [2024-11-28 02:47:25,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:25,423 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 02:47:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356365825] [2024-11-28 02:47:25,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356365825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:25,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937402843] [2024-11-28 02:47:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:25,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:25,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:25,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:25,428 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 02:47:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:25,545 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2024-11-28 02:47:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-28 02:47:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:25,547 INFO L225 Difference]: With dead ends: 106 [2024-11-28 02:47:25,548 INFO L226 Difference]: Without dead ends: 106 [2024-11-28 02:47:25,548 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 02:47:25,549 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:25,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:47:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-28 02:47:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-11-28 02:47:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 97 states have internal predecessors, (101), 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 02:47:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2024-11-28 02:47:25,570 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 13 [2024-11-28 02:47:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:25,570 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2024-11-28 02:47:25,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 02:47:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2024-11-28 02:47:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 02:47:25,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:25,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:25,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:47:25,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2102540234, now seen corresponding path program 1 times [2024-11-28 02:47:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642127200] [2024-11-28 02:47:25,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:25,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:25,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642127200] [2024-11-28 02:47:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642127200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:25,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:25,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:47:25,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300966812] [2024-11-28 02:47:25,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:26,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:26,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:26,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:26,002 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 02:47:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:26,304 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-28 02:47:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:47:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2024-11-28 02:47:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:26,306 INFO L225 Difference]: With dead ends: 100 [2024-11-28 02:47:26,306 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 02:47:26,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:26,308 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 44 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:26,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 249 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 02:47:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-28 02:47:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 91 states have internal predecessors, (95), 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 02:47:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-28 02:47:26,322 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 15 [2024-11-28 02:47:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:26,323 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-28 02:47:26,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 02:47:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-28 02:47:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 02:47:26,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:26,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:26,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:47:26,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:26,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2102540235, now seen corresponding path program 1 times [2024-11-28 02:47:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:26,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13070119] [2024-11-28 02:47:26,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:26,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13070119] [2024-11-28 02:47:27,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13070119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:27,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:27,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:47:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115557547] [2024-11-28 02:47:27,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:27,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:47:27,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:27,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:47:27,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:27,074 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 02:47:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:27,395 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-28 02:47:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:47:27,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 15 [2024-11-28 02:47:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:27,397 INFO L225 Difference]: With dead ends: 98 [2024-11-28 02:47:27,397 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 02:47:27,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:27,398 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 16 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:27,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 282 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 02:47:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-28 02:47:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 89 states have internal predecessors, (93), 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 02:47:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-28 02:47:27,411 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 15 [2024-11-28 02:47:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:27,412 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-28 02:47:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 02:47:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-28 02:47:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 02:47:27,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:27,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:27,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:47:27,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:27,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1805854436, now seen corresponding path program 1 times [2024-11-28 02:47:27,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:27,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543147392] [2024-11-28 02:47:27,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:27,630 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 02:47:27,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543147392] [2024-11-28 02:47:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543147392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:27,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:47:27,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285302696] [2024-11-28 02:47:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:27,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:27,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:27,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:27,637 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 02:47:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:27,864 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2024-11-28 02:47:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:47:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2024-11-28 02:47:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:27,868 INFO L225 Difference]: With dead ends: 127 [2024-11-28 02:47:27,868 INFO L226 Difference]: Without dead ends: 127 [2024-11-28 02:47:27,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:27,869 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:27,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 269 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:47:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-28 02:47:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2024-11-28 02:47:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 109 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2024-11-28 02:47:27,887 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 22 [2024-11-28 02:47:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:27,887 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2024-11-28 02:47:27,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 02:47:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2024-11-28 02:47:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 02:47:27,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:27,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:27,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:47:27,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:27,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1805854435, now seen corresponding path program 1 times [2024-11-28 02:47:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:27,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206030880] [2024-11-28 02:47:27,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:27,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:28,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:28,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206030880] [2024-11-28 02:47:28,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206030880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:28,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:28,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:47:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714418691] [2024-11-28 02:47:28,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:28,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:47:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:28,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:47:28,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:47:28,219 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 02:47:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:28,484 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2024-11-28 02:47:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:47:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 22 [2024-11-28 02:47:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:28,486 INFO L225 Difference]: With dead ends: 132 [2024-11-28 02:47:28,486 INFO L226 Difference]: Without dead ends: 132 [2024-11-28 02:47:28,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:47:28,488 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:28,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 507 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:47:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-28 02:47:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2024-11-28 02:47:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 118 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2024-11-28 02:47:28,500 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 22 [2024-11-28 02:47:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:28,501 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2024-11-28 02:47:28,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 02:47:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2024-11-28 02:47:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 02:47:28,502 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:28,502 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] [2024-11-28 02:47:28,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:47:28,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:28,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -259248149, now seen corresponding path program 1 times [2024-11-28 02:47:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:28,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359670857] [2024-11-28 02:47:28,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:28,685 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 02:47:28,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:28,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359670857] [2024-11-28 02:47:28,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359670857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:28,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:28,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:47:28,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141592116] [2024-11-28 02:47:28,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:28,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:47:28,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:28,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:47:28,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:28,688 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 02:47:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:28,758 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2024-11-28 02:47:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:47:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 24 [2024-11-28 02:47:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:28,760 INFO L225 Difference]: With dead ends: 137 [2024-11-28 02:47:28,760 INFO L226 Difference]: Without dead ends: 137 [2024-11-28 02:47:28,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:28,761 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:28,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 557 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:47:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-28 02:47:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-11-28 02:47:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 120 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2024-11-28 02:47:28,770 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 24 [2024-11-28 02:47:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:28,771 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2024-11-28 02:47:28,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 02:47:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2024-11-28 02:47:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 02:47:28,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:28,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:28,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:47:28,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:28,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash 275013806, now seen corresponding path program 1 times [2024-11-28 02:47:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699335921] [2024-11-28 02:47:28,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699335921] [2024-11-28 02:47:29,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699335921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:29,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:47:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833883965] [2024-11-28 02:47:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:29,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:29,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:29,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:29,065 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 02:47:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:29,309 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2024-11-28 02:47:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:47:29,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 26 [2024-11-28 02:47:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:29,310 INFO L225 Difference]: With dead ends: 125 [2024-11-28 02:47:29,310 INFO L226 Difference]: Without dead ends: 125 [2024-11-28 02:47:29,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:29,311 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 19 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:29,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 200 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:47:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-28 02:47:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-28 02:47:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 120 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2024-11-28 02:47:29,316 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 26 [2024-11-28 02:47:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:29,317 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2024-11-28 02:47:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 02:47:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2024-11-28 02:47:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 02:47:29,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:29,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:29,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:47:29,318 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:29,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash 275013807, now seen corresponding path program 1 times [2024-11-28 02:47:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:29,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850763535] [2024-11-28 02:47:29,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850763535] [2024-11-28 02:47:29,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850763535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920454197] [2024-11-28 02:47:29,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:29,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:29,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:29,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:29,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:47:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:29,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 02:47:29,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:30,135 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-28 02:47:30,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:47:30,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:47:30,271 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:47:30,272 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 02:47:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:30,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:47:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920454197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:47:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-28 02:47:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113992844] [2024-11-28 02:47:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:30,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:30,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:30,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-28 02:47:30,315 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 02:47:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:30,554 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2024-11-28 02:47:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:47:30,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2024-11-28 02:47:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:30,556 INFO L225 Difference]: With dead ends: 131 [2024-11-28 02:47:30,556 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 02:47:30,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-28 02:47:30,557 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:30,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 208 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2024-11-28 02:47:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 02:47:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2024-11-28 02:47:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.5454545454545454) internal successors, (136), 120 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2024-11-28 02:47:30,563 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 26 [2024-11-28 02:47:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:30,564 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2024-11-28 02:47:30,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 02:47:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2024-11-28 02:47:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 02:47:30,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:30,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:30,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:47:30,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 02:47:30,769 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:30,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -101890816, now seen corresponding path program 1 times [2024-11-28 02:47:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600134083] [2024-11-28 02:47:30,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600134083] [2024-11-28 02:47:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600134083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:47:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246928329] [2024-11-28 02:47:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:30,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:30,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:30,974 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 02:47:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:31,244 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-28 02:47:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:47:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 26 [2024-11-28 02:47:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:31,247 INFO L225 Difference]: With dead ends: 144 [2024-11-28 02:47:31,247 INFO L226 Difference]: Without dead ends: 144 [2024-11-28 02:47:31,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:31,248 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:31,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 292 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-28 02:47:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2024-11-28 02:47:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.530612244897959) internal successors, (150), 130 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2024-11-28 02:47:31,258 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 26 [2024-11-28 02:47:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:31,259 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2024-11-28 02:47:31,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 02:47:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2024-11-28 02:47:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 02:47:31,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:31,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:31,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:47:31,263 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:31,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash -101890815, now seen corresponding path program 1 times [2024-11-28 02:47:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:31,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826182649] [2024-11-28 02:47:31,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:31,562 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 02:47:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826182649] [2024-11-28 02:47:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826182649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:31,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:47:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860336307] [2024-11-28 02:47:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:31,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:47:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:31,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:47:31,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:47:31,564 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 02:47:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:31,808 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2024-11-28 02:47:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:47:31,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 26 [2024-11-28 02:47:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:31,810 INFO L225 Difference]: With dead ends: 139 [2024-11-28 02:47:31,810 INFO L226 Difference]: Without dead ends: 139 [2024-11-28 02:47:31,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:47:31,813 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:31,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 557 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:47:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-28 02:47:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-28 02:47:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 134 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2024-11-28 02:47:31,823 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 26 [2024-11-28 02:47:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:31,823 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2024-11-28 02:47:31,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 02:47:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2024-11-28 02:47:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 02:47:31,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:31,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:31,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:47:31,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:31,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1861294270, now seen corresponding path program 1 times [2024-11-28 02:47:31,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:31,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010789106] [2024-11-28 02:47:31,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:47:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010789106] [2024-11-28 02:47:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010789106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:32,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:32,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:47:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743626088] [2024-11-28 02:47:32,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:32,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:32,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:32,235 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:47:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:32,522 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-28 02:47:32,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:47:32,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-28 02:47:32,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:32,524 INFO L225 Difference]: With dead ends: 138 [2024-11-28 02:47:32,524 INFO L226 Difference]: Without dead ends: 138 [2024-11-28 02:47:32,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:32,525 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:32,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 348 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-28 02:47:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-28 02:47:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 133 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2024-11-28 02:47:32,533 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 29 [2024-11-28 02:47:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:32,533 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2024-11-28 02:47:32,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:47:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2024-11-28 02:47:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 02:47:32,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:32,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:32,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:47:32,537 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:32,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1861294271, now seen corresponding path program 1 times [2024-11-28 02:47:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:32,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953331723] [2024-11-28 02:47:32,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:47:32,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953331723] [2024-11-28 02:47:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953331723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:32,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:32,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:47:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051281767] [2024-11-28 02:47:32,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:32,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:32,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:32,753 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:47:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:33,052 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2024-11-28 02:47:33,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:47:33,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-28 02:47:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:33,054 INFO L225 Difference]: With dead ends: 137 [2024-11-28 02:47:33,054 INFO L226 Difference]: Without dead ends: 137 [2024-11-28 02:47:33,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:33,055 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:33,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 313 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-28 02:47:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-28 02:47:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 132 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2024-11-28 02:47:33,065 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 29 [2024-11-28 02:47:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:33,065 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2024-11-28 02:47:33,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:47:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2024-11-28 02:47:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:47:33,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:33,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:33,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:47:33,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:33,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1789817099, now seen corresponding path program 1 times [2024-11-28 02:47:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723077614] [2024-11-28 02:47:33,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723077614] [2024-11-28 02:47:33,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723077614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:33,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:33,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:47:33,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386509886] [2024-11-28 02:47:33,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:33,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:47:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:33,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:47:33,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:47:33,580 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 02:47:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:34,091 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2024-11-28 02:47:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:47:34,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2024-11-28 02:47:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:34,093 INFO L225 Difference]: With dead ends: 138 [2024-11-28 02:47:34,093 INFO L226 Difference]: Without dead ends: 138 [2024-11-28 02:47:34,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:47:34,094 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:34,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 483 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:47:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-28 02:47:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2024-11-28 02:47:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 132 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2024-11-28 02:47:34,105 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 32 [2024-11-28 02:47:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:34,106 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2024-11-28 02:47:34,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 02:47:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2024-11-28 02:47:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:47:34,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:34,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:34,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:47:34,107 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:34,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1789817098, now seen corresponding path program 1 times [2024-11-28 02:47:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079231158] [2024-11-28 02:47:34,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:34,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079231158] [2024-11-28 02:47:34,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079231158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:34,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:34,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:47:34,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817999716] [2024-11-28 02:47:34,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:34,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:47:34,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:34,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:47:34,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:47:34,806 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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 02:47:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:35,272 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2024-11-28 02:47:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:47:35,272 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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 32 [2024-11-28 02:47:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:35,273 INFO L225 Difference]: With dead ends: 137 [2024-11-28 02:47:35,273 INFO L226 Difference]: Without dead ends: 137 [2024-11-28 02:47:35,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:47:35,274 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 25 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:35,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 456 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:47:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-28 02:47:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-28 02:47:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4509803921568627) internal successors, (148), 132 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2024-11-28 02:47:35,280 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 32 [2024-11-28 02:47:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:35,280 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2024-11-28 02:47:35,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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 02:47:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2024-11-28 02:47:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 02:47:35,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:35,282 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] [2024-11-28 02:47:35,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:47:35,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:35,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash -196997708, now seen corresponding path program 1 times [2024-11-28 02:47:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832848472] [2024-11-28 02:47:35,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:35,432 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 02:47:35,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832848472] [2024-11-28 02:47:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832848472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:35,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:47:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465148227] [2024-11-28 02:47:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:35,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:47:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:35,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:47:35,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:35,435 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 02:47:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:35,764 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2024-11-28 02:47:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:47:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 31 [2024-11-28 02:47:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:35,765 INFO L225 Difference]: With dead ends: 155 [2024-11-28 02:47:35,766 INFO L226 Difference]: Without dead ends: 155 [2024-11-28 02:47:35,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:47:35,766 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:35,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 298 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-28 02:47:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2024-11-28 02:47:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 114 states have (on average 1.4736842105263157) internal successors, (168), 143 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2024-11-28 02:47:35,773 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 31 [2024-11-28 02:47:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:35,774 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2024-11-28 02:47:35,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 02:47:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2024-11-28 02:47:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 02:47:35,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:35,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] [2024-11-28 02:47:35,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:47:35,775 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash -196997707, now seen corresponding path program 1 times [2024-11-28 02:47:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092933020] [2024-11-28 02:47:35,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:36,140 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 02:47:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092933020] [2024-11-28 02:47:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092933020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622607765] [2024-11-28 02:47:36,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:36,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:36,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:36,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:36,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:47:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:36,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 02:47:36,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:36,683 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 02:47:36,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:47:36,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:47:36,831 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 19 treesize of output 23 [2024-11-28 02:47:37,282 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 02:47:37,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622607765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:47:37,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:47:37,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2024-11-28 02:47:37,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686469023] [2024-11-28 02:47:37,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:47:37,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 02:47:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:37,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 02:47:37,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2024-11-28 02:47:37,285 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 26 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 02:47:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:37,992 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2024-11-28 02:47:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:47:37,993 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 26 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-11-28 02:47:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:37,994 INFO L225 Difference]: With dead ends: 154 [2024-11-28 02:47:37,994 INFO L226 Difference]: Without dead ends: 154 [2024-11-28 02:47:37,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2024-11-28 02:47:37,996 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 148 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:37,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 858 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:47:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-28 02:47:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2024-11-28 02:47:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 145 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2024-11-28 02:47:38,007 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 31 [2024-11-28 02:47:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:38,008 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2024-11-28 02:47:38,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 26 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 02:47:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2024-11-28 02:47:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:47:38,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:38,011 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] [2024-11-28 02:47:38,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:47:38,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:38,212 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:38,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1811961577, now seen corresponding path program 1 times [2024-11-28 02:47:38,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:38,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662480475] [2024-11-28 02:47:38,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:38,568 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 02:47:38,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:38,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662480475] [2024-11-28 02:47:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662480475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:38,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474003980] [2024-11-28 02:47:38,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:38,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:38,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:38,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:38,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:47:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:38,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 02:47:38,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:38,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:47:39,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 02:47:39,248 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 02:47:39,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:47:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474003980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:39,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:47:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2024-11-28 02:47:39,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788317241] [2024-11-28 02:47:39,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:39,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:47:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:39,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:47:39,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:47:39,253 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 02:47:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:39,653 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2024-11-28 02:47:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:47:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 32 [2024-11-28 02:47:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:39,658 INFO L225 Difference]: With dead ends: 175 [2024-11-28 02:47:39,659 INFO L226 Difference]: Without dead ends: 175 [2024-11-28 02:47:39,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:47:39,663 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:39,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 569 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-28 02:47:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2024-11-28 02:47:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 149 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2024-11-28 02:47:39,672 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 32 [2024-11-28 02:47:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2024-11-28 02:47:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 02:47:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2024-11-28 02:47:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 02:47:39,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:39,674 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] [2024-11-28 02:47:39,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:47:39,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 02:47:39,879 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:39,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -336233900, now seen corresponding path program 1 times [2024-11-28 02:47:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:39,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153442562] [2024-11-28 02:47:39,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:40,333 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 02:47:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153442562] [2024-11-28 02:47:40,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153442562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088396343] [2024-11-28 02:47:40,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:40,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:40,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:40,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:40,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:47:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:40,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 02:47:40,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:40,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:47:40,769 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 29 treesize of output 13 [2024-11-28 02:47:40,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-28 02:47:40,954 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 02:47:40,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:47:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088396343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:40,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:47:40,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2024-11-28 02:47:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104775661] [2024-11-28 02:47:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:40,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:47:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:40,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:47:40,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:47:40,956 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 02:47:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:41,327 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2024-11-28 02:47:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:47:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 33 [2024-11-28 02:47:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:41,328 INFO L225 Difference]: With dead ends: 174 [2024-11-28 02:47:41,328 INFO L226 Difference]: Without dead ends: 174 [2024-11-28 02:47:41,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:47:41,329 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 41 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:41,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 487 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-28 02:47:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2024-11-28 02:47:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 150 states have internal predecessors, (176), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2024-11-28 02:47:41,335 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 33 [2024-11-28 02:47:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:41,335 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-11-28 02:47:41,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 02:47:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2024-11-28 02:47:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 02:47:41,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:41,336 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] [2024-11-28 02:47:41,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 02:47:41,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 02:47:41,541 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:41,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash -335610916, now seen corresponding path program 1 times [2024-11-28 02:47:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009759352] [2024-11-28 02:47:41,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:41,699 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 02:47:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:41,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009759352] [2024-11-28 02:47:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009759352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:41,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:47:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80620055] [2024-11-28 02:47:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:41,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:47:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:41,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:47:41,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:47:41,703 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 02:47:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:41,803 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2024-11-28 02:47:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:47:41,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 33 [2024-11-28 02:47:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:41,805 INFO L225 Difference]: With dead ends: 155 [2024-11-28 02:47:41,805 INFO L226 Difference]: Without dead ends: 155 [2024-11-28 02:47:41,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:47:41,806 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:41,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 508 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:47:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-28 02:47:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-11-28 02:47:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.396694214876033) internal successors, (169), 148 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2024-11-28 02:47:41,812 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 33 [2024-11-28 02:47:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:41,812 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2024-11-28 02:47:41,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 02:47:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2024-11-28 02:47:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 02:47:41,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:41,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:41,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 02:47:41,813 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:41,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash -408759159, now seen corresponding path program 1 times [2024-11-28 02:47:41,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:41,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432346654] [2024-11-28 02:47:41,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:42,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:42,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432346654] [2024-11-28 02:47:42,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432346654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:42,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202241837] [2024-11-28 02:47:42,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:42,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:42,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:42,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:42,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:47:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:43,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-28 02:47:43,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:43,178 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 02:47:43,211 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 02:47:43,219 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 02:47:43,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 02:47:43,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 02:47:43,559 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:47:43,559 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 02:47:43,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 02:47:43,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 02:47:43,850 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 02:47:43,850 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 02:47:43,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 02:47:43,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 02:47:44,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 02:47:44,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 02:47:44,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:47:44,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-28 02:47:44,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-28 02:47:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:44,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:47:47,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:47:47,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-28 02:47:47,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:47:47,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 62 [2024-11-28 02:47:47,096 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 28 treesize of output 24 [2024-11-28 02:47:47,101 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 42 treesize of output 34 [2024-11-28 02:47:47,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:47:47,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-28 02:47:47,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:47:47,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 62 [2024-11-28 02:47:47,179 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 28 treesize of output 24 [2024-11-28 02:47:47,184 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 42 treesize of output 34 [2024-11-28 02:47:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:47,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202241837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:47:47,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:47:47,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 40 [2024-11-28 02:47:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572178590] [2024-11-28 02:47:47,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:47:47,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-28 02:47:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:47,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 02:47:47,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1390, Unknown=25, NotChecked=0, Total=1560 [2024-11-28 02:47:47,361 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 40 states, 40 states have (on average 1.875) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 02:47:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:49,289 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-11-28 02:47:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:47:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-11-28 02:47:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:49,292 INFO L225 Difference]: With dead ends: 148 [2024-11-28 02:47:49,292 INFO L226 Difference]: Without dead ends: 148 [2024-11-28 02:47:49,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=216, Invalid=2011, Unknown=29, NotChecked=0, Total=2256 [2024-11-28 02:47:49,293 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 26 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:49,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1212 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:47:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-28 02:47:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-28 02:47:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 143 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2024-11-28 02:47:49,300 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 33 [2024-11-28 02:47:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:49,300 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-28 02:47:49,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 02:47:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2024-11-28 02:47:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:47:49,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:49,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:49,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:47:49,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 02:47:49,502 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:49,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1577809384, now seen corresponding path program 1 times [2024-11-28 02:47:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:49,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046346769] [2024-11-28 02:47:49,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046346769] [2024-11-28 02:47:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046346769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:49,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:47:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950382760] [2024-11-28 02:47:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:47:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:49,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:47:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:47:49,988 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 02:47:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:50,536 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2024-11-28 02:47:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:47:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 35 [2024-11-28 02:47:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:50,538 INFO L225 Difference]: With dead ends: 149 [2024-11-28 02:47:50,538 INFO L226 Difference]: Without dead ends: 149 [2024-11-28 02:47:50,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:47:50,539 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:50,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 444 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:47:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-28 02:47:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2024-11-28 02:47:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 143 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2024-11-28 02:47:50,547 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 35 [2024-11-28 02:47:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:50,548 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2024-11-28 02:47:50,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 02:47:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2024-11-28 02:47:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:47:50,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:50,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:47:50,550 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:50,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1577809385, now seen corresponding path program 1 times [2024-11-28 02:47:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:50,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131366158] [2024-11-28 02:47:50,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:51,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131366158] [2024-11-28 02:47:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131366158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:51,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:51,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:47:51,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54265572] [2024-11-28 02:47:51,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:51,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:47:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:51,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:47:51,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:47:51,287 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 02:47:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:51,772 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2024-11-28 02:47:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:47:51,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2024-11-28 02:47:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:51,774 INFO L225 Difference]: With dead ends: 148 [2024-11-28 02:47:51,774 INFO L226 Difference]: Without dead ends: 148 [2024-11-28 02:47:51,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:47:51,775 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 29 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:51,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 390 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:47:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-28 02:47:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-28 02:47:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 143 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 165 transitions. [2024-11-28 02:47:51,784 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 165 transitions. Word has length 35 [2024-11-28 02:47:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:51,784 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 165 transitions. [2024-11-28 02:47:51,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 02:47:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2024-11-28 02:47:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 02:47:51,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:51,785 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] [2024-11-28 02:47:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:47:51,785 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1833316167, now seen corresponding path program 1 times [2024-11-28 02:47:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135210006] [2024-11-28 02:47:51,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:52,321 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 02:47:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135210006] [2024-11-28 02:47:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135210006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120960467] [2024-11-28 02:47:52,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:52,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:52,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:52,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:52,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:47:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:52,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 02:47:52,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:52,625 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 02:47:52,692 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 02:47:52,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 02:47:52,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:47:52,813 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 29 treesize of output 13 [2024-11-28 02:47:53,006 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 17 treesize of output 9 [2024-11-28 02:47:53,012 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 02:47:53,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:47:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120960467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:47:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-28 02:47:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72004768] [2024-11-28 02:47:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:53,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:47:53,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:53,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:47:53,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:47:53,014 INFO L87 Difference]: Start difference. First operand 148 states and 165 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 02:47:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:53,356 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2024-11-28 02:47:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:47:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 34 [2024-11-28 02:47:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:53,359 INFO L225 Difference]: With dead ends: 149 [2024-11-28 02:47:53,359 INFO L226 Difference]: Without dead ends: 149 [2024-11-28 02:47:53,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-28 02:47:53,362 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:53,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 526 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-28 02:47:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-28 02:47:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 144 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2024-11-28 02:47:53,369 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 34 [2024-11-28 02:47:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:53,369 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2024-11-28 02:47:53,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 02:47:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2024-11-28 02:47:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:47:53,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:53,371 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 02:47:53,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:47:53,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 02:47:53,572 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash -998226185, now seen corresponding path program 1 times [2024-11-28 02:47:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065902280] [2024-11-28 02:47:53,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:54,076 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 02:47:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065902280] [2024-11-28 02:47:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065902280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722224876] [2024-11-28 02:47:54,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:54,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:54,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:54,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:54,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:47:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:54,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 02:47:54,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:54,292 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 02:47:54,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:47:54,318 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 02:47:54,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:47:54,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-28 02:47:54,499 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 16 treesize of output 8 [2024-11-28 02:47:54,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:47:54,519 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 02:47:54,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:47:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722224876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:54,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:47:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2024-11-28 02:47:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558756178] [2024-11-28 02:47:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:54,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:47:54,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:54,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:47:54,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:47:54,520 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 02:47:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:54,903 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2024-11-28 02:47:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:47:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 35 [2024-11-28 02:47:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:54,904 INFO L225 Difference]: With dead ends: 160 [2024-11-28 02:47:54,904 INFO L226 Difference]: Without dead ends: 160 [2024-11-28 02:47:54,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:47:54,904 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:54,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 519 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:47:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-28 02:47:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2024-11-28 02:47:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 145 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2024-11-28 02:47:54,909 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 35 [2024-11-28 02:47:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:54,910 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2024-11-28 02:47:54,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 02:47:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2024-11-28 02:47:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 02:47:54,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:54,910 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] [2024-11-28 02:47:54,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:47:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 02:47:55,114 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:55,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -880240579, now seen corresponding path program 1 times [2024-11-28 02:47:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980214096] [2024-11-28 02:47:55,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:55,434 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 02:47:55,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:55,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980214096] [2024-11-28 02:47:55,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980214096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:55,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:55,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:47:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297631940] [2024-11-28 02:47:55,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:55,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:47:55,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:55,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:47:55,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:47:55,436 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 02:47:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:55,713 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2024-11-28 02:47:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:47:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 36 [2024-11-28 02:47:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:55,714 INFO L225 Difference]: With dead ends: 159 [2024-11-28 02:47:55,714 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 02:47:55,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:47:55,715 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:55,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 580 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:47:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 02:47:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2024-11-28 02:47:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.361344537815126) internal successors, (162), 146 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2024-11-28 02:47:55,720 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 36 [2024-11-28 02:47:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:55,721 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2024-11-28 02:47:55,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 02:47:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2024-11-28 02:47:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 02:47:55,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:55,722 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] [2024-11-28 02:47:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:47:55,722 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:55,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1517654025, now seen corresponding path program 1 times [2024-11-28 02:47:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247015501] [2024-11-28 02:47:55,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:56,162 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 02:47:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247015501] [2024-11-28 02:47:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247015501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:47:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399816992] [2024-11-28 02:47:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:56,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:47:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:56,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:47:56,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:47:56,165 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 02:47:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:56,626 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2024-11-28 02:47:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:47:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 37 [2024-11-28 02:47:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:56,628 INFO L225 Difference]: With dead ends: 158 [2024-11-28 02:47:56,628 INFO L226 Difference]: Without dead ends: 158 [2024-11-28 02:47:56,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:47:56,629 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 40 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:56,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 513 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:47:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-28 02:47:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2024-11-28 02:47:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 147 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2024-11-28 02:47:56,635 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 37 [2024-11-28 02:47:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:56,636 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2024-11-28 02:47:56,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 02:47:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2024-11-28 02:47:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 02:47:56,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:56,637 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] [2024-11-28 02:47:56,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:47:56,637 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:56,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:56,638 INFO L85 PathProgramCache]: Analyzing trace with hash 197365631, now seen corresponding path program 1 times [2024-11-28 02:47:56,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:56,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857419228] [2024-11-28 02:47:56,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:56,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:57,498 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 02:47:57,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857419228] [2024-11-28 02:47:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857419228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:47:57,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957462978] [2024-11-28 02:47:57,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:57,503 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:57,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:47:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:57,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-28 02:47:57,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:57,843 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 02:47:57,943 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:47:57,943 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 02:47:58,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:47:58,123 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 43 treesize of output 23 [2024-11-28 02:47:58,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-28 02:47:58,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:47:58,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 02:47:58,653 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 02:47:58,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:47:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957462978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:58,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:47:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 27 [2024-11-28 02:47:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939369259] [2024-11-28 02:47:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:58,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:47:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:58,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:47:58,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:47:58,655 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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 02:47:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:59,252 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2024-11-28 02:47:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:47:59,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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 38 [2024-11-28 02:47:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:59,254 INFO L225 Difference]: With dead ends: 153 [2024-11-28 02:47:59,254 INFO L226 Difference]: Without dead ends: 153 [2024-11-28 02:47:59,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2024-11-28 02:47:59,255 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:59,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 582 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:47:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-28 02:47:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-28 02:47:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 148 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:47:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2024-11-28 02:47:59,264 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 38 [2024-11-28 02:47:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:59,264 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2024-11-28 02:47:59,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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 02:47:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2024-11-28 02:47:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 02:47:59,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:59,265 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] [2024-11-28 02:47:59,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 02:47:59,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 02:47:59,470 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:47:59,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash 689815429, now seen corresponding path program 1 times [2024-11-28 02:47:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:59,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216050634] [2024-11-28 02:47:59,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:00,123 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 02:48:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:00,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216050634] [2024-11-28 02:48:00,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216050634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:48:00,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112672014] [2024-11-28 02:48:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:00,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:48:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:00,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:48:00,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:48:00,125 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 02:48:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:00,649 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2024-11-28 02:48:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:48:00,649 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 40 [2024-11-28 02:48:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:00,650 INFO L225 Difference]: With dead ends: 157 [2024-11-28 02:48:00,652 INFO L226 Difference]: Without dead ends: 157 [2024-11-28 02:48:00,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:48:00,653 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 43 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:00,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 577 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:48:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-28 02:48:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-28 02:48:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3495934959349594) internal successors, (166), 150 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:48:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2024-11-28 02:48:00,663 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 40 [2024-11-28 02:48:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:00,663 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2024-11-28 02:48:00,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 02:48:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2024-11-28 02:48:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 02:48:00,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:00,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:00,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 02:48:00,665 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:48:00,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1045154648, now seen corresponding path program 1 times [2024-11-28 02:48:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642692011] [2024-11-28 02:48:00,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:48:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642692011] [2024-11-28 02:48:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642692011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339997877] [2024-11-28 02:48:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:01,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:01,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:01,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:01,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:48:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:01,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 02:48:01,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 02:48:01,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:01,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:01,775 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 19 treesize of output 23 [2024-11-28 02:48:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 02:48:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339997877] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:48:01,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:48:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2024-11-28 02:48:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539308086] [2024-11-28 02:48:01,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:01,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:48:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:01,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:48:01,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:48:01,959 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:48:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:02,328 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2024-11-28 02:48:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:48:02,329 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-28 02:48:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:02,330 INFO L225 Difference]: With dead ends: 158 [2024-11-28 02:48:02,330 INFO L226 Difference]: Without dead ends: 158 [2024-11-28 02:48:02,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:48:02,331 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:02,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 699 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:48:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-28 02:48:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-11-28 02:48:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 150 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:48:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-28 02:48:02,338 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 44 [2024-11-28 02:48:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:02,339 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-28 02:48:02,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:48:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-28 02:48:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 02:48:02,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:02,340 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] [2024-11-28 02:48:02,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 02:48:02,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:02,545 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:48:02,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1126961692, now seen corresponding path program 1 times [2024-11-28 02:48:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073395720] [2024-11-28 02:48:02,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:02,728 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 02:48:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073395720] [2024-11-28 02:48:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073395720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:48:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862808497] [2024-11-28 02:48:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:48:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:02,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:48:02,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:48:02,730 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 02:48:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:02,916 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2024-11-28 02:48:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:48:02,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 43 [2024-11-28 02:48:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:02,918 INFO L225 Difference]: With dead ends: 156 [2024-11-28 02:48:02,918 INFO L226 Difference]: Without dead ends: 156 [2024-11-28 02:48:02,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:48:02,919 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:02,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 448 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:48:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-28 02:48:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-28 02:48:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 151 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:48:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-28 02:48:02,925 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 43 [2024-11-28 02:48:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:02,925 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-28 02:48:02,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 02:48:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-28 02:48:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 02:48:02,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:02,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:02,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 02:48:02,928 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:48:02,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1959944306, now seen corresponding path program 1 times [2024-11-28 02:48:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977658336] [2024-11-28 02:48:02,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977658336] [2024-11-28 02:48:03,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977658336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876305295] [2024-11-28 02:48:03,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:03,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:03,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:03,549 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:03,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:48:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:03,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 02:48:03,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:03,959 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-28 02:48:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:03,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:48:04,007 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:48:04,008 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 02:48:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:04,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876305295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:04,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-28 02:48:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097876898] [2024-11-28 02:48:04,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:04,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:48:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:04,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:48:04,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=611, Unknown=1, NotChecked=50, Total=756 [2024-11-28 02:48:04,439 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:48:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:05,010 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2024-11-28 02:48:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:48:05,011 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-11-28 02:48:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:05,012 INFO L225 Difference]: With dead ends: 206 [2024-11-28 02:48:05,012 INFO L226 Difference]: Without dead ends: 206 [2024-11-28 02:48:05,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=762, Unknown=1, NotChecked=56, Total=930 [2024-11-28 02:48:05,013 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 94 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:05,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 778 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 661 Invalid, 0 Unknown, 164 Unchecked, 0.5s Time] [2024-11-28 02:48:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-28 02:48:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 177. [2024-11-28 02:48:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 171 states have internal predecessors, (193), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:48:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2024-11-28 02:48:05,018 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 45 [2024-11-28 02:48:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:05,018 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2024-11-28 02:48:05,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:48:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2024-11-28 02:48:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 02:48:05,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:05,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-28 02:48:05,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:48:05,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 02:48:05,224 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:48:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1002635591, now seen corresponding path program 1 times [2024-11-28 02:48:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87525285] [2024-11-28 02:48:05,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:48:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87525285] [2024-11-28 02:48:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87525285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803298961] [2024-11-28 02:48:05,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:05,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:05,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:05,920 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:05,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:48:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:06,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 02:48:06,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:06,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:48:06,227 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 02:48:06,252 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 02:48:06,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:06,315 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 02:48:06,370 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:06,371 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 02:48:06,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:06,424 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 02:48:06,439 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 02:48:06,458 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-28 02:48:06,505 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:48:06,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 02:48:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-11-28 02:48:06,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803298961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:06,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:06,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 23 [2024-11-28 02:48:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94098409] [2024-11-28 02:48:06,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:06,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:48:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:06,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:48:06,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2024-11-28 02:48:06,591 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 02:48:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:07,226 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2024-11-28 02:48:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:48:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-11-28 02:48:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:07,228 INFO L225 Difference]: With dead ends: 174 [2024-11-28 02:48:07,228 INFO L226 Difference]: Without dead ends: 174 [2024-11-28 02:48:07,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=805, Unknown=1, NotChecked=58, Total=992 [2024-11-28 02:48:07,229 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 21 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:07,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 672 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 600 Invalid, 0 Unknown, 82 Unchecked, 0.4s Time] [2024-11-28 02:48:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-28 02:48:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-28 02:48:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 144 states have (on average 1.2986111111111112) internal successors, (187), 168 states have internal predecessors, (187), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:48:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2024-11-28 02:48:07,235 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 48 [2024-11-28 02:48:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:07,235 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2024-11-28 02:48:07,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 02:48:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2024-11-28 02:48:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 02:48:07,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:07,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-28 02:48:07,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 02:48:07,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:07,441 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:48:07,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1002635590, now seen corresponding path program 1 times [2024-11-28 02:48:07,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:07,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796521384] [2024-11-28 02:48:07,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:07,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:08,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:08,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796521384] [2024-11-28 02:48:08,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796521384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:08,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277514074] [2024-11-28 02:48:08,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:08,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:08,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:08,734 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:08,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:48:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:09,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 02:48:09,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:09,083 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 02:48:09,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:48:09,169 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 02:48:09,217 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 02:48:09,222 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 02:48:09,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:09,357 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 02:48:09,375 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 02:48:09,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:09,483 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 02:48:09,493 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 02:48:09,601 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:48:09,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 73 treesize of output 66 [2024-11-28 02:48:09,610 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 02:48:09,634 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 02:48:09,642 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 02:48:09,703 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-28 02:48:09,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:09,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:48:09,747 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:48:09,748 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 02:48:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-28 02:48:09,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277514074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:09,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 25 [2024-11-28 02:48:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188162079] [2024-11-28 02:48:09,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:09,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:48:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:09,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:48:09,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=623, Unknown=1, NotChecked=50, Total=756 [2024-11-28 02:48:09,931 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:48:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:11,156 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2024-11-28 02:48:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:48:11,157 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2024-11-28 02:48:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:11,158 INFO L225 Difference]: With dead ends: 169 [2024-11-28 02:48:11,158 INFO L226 Difference]: Without dead ends: 169 [2024-11-28 02:48:11,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=1221, Unknown=1, NotChecked=72, Total=1482 [2024-11-28 02:48:11,160 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 43 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:11,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 888 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 914 Invalid, 0 Unknown, 96 Unchecked, 0.8s Time] [2024-11-28 02:48:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-28 02:48:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-28 02:48:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.2291666666666667) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:48:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2024-11-28 02:48:11,165 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 48 [2024-11-28 02:48:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:11,166 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2024-11-28 02:48:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:48:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2024-11-28 02:48:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 02:48:11,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:11,167 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 02:48:11,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 02:48:11,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:11,367 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:48:11,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash 443755853, now seen corresponding path program 1 times [2024-11-28 02:48:11,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:11,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067302499] [2024-11-28 02:48:11,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067302499] [2024-11-28 02:48:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067302499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892244152] [2024-11-28 02:48:12,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:12,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:12,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:12,079 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:12,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:48:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:12,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-28 02:48:12,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:12,363 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 02:48:12,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:48:12,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:48:12,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:48:12,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:48:12,747 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:48:12,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 02:48:12,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-28 02:48:12,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-28 02:48:12,969 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:48:12,969 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 02:48:13,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-28 02:48:13,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-28 02:48:13,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 02:48:13,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 02:48:13,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:13,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 02:48:13,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 02:48:13,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:13,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-28 02:48:13,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:13,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-28 02:48:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:48:14,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:16,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:16,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-11-28 02:48:16,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 104 treesize of output 98 [2024-11-28 02:48:16,714 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 276 treesize of output 268 [2024-11-28 02:48:16,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:16,755 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 117 treesize of output 125 [2024-11-28 02:48:16,777 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 99 treesize of output 97 [2024-11-28 02:48:16,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:16,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-11-28 02:48:16,971 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 198 treesize of output 190 [2024-11-28 02:48:16,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:16,996 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 155 treesize of output 161 [2024-11-28 02:48:17,009 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 158 treesize of output 154 [2024-11-28 02:48:17,024 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 234 treesize of output 226 [2024-11-28 02:48:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:48:17,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892244152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:48:17,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:48:17,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 21] total 49 [2024-11-28 02:48:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725133692] [2024-11-28 02:48:17,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:17,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-28 02:48:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:17,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-28 02:48:17,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2164, Unknown=30, NotChecked=0, Total=2352 [2024-11-28 02:48:17,575 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand has 49 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 46 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 02:48:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:20,048 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2024-11-28 02:48:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 02:48:20,049 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 46 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-28 02:48:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:20,050 INFO L225 Difference]: With dead ends: 213 [2024-11-28 02:48:20,050 INFO L226 Difference]: Without dead ends: 213 [2024-11-28 02:48:20,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=280, Invalid=3595, Unknown=31, NotChecked=0, Total=3906 [2024-11-28 02:48:20,052 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:20,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1399 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 02:48:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-28 02:48:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2024-11-28 02:48:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.2619047619047619) internal successors, (212), 187 states have internal predecessors, (212), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:48:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2024-11-28 02:48:20,058 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 46 [2024-11-28 02:48:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:20,058 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2024-11-28 02:48:20,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 46 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 02:48:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2024-11-28 02:48:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 02:48:20,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:20,059 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] [2024-11-28 02:48:20,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 02:48:20,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-28 02:48:20,264 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:48:20,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash 871531996, now seen corresponding path program 1 times [2024-11-28 02:48:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800519394] [2024-11-28 02:48:20,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800519394] [2024-11-28 02:48:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800519394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804778315] [2024-11-28 02:48:22,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:22,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:22,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:22,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:22,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 02:48:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:22,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-28 02:48:22,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:23,183 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 02:48:23,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-11-28 02:48:24,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:48:24,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 458 treesize of output 342 [2024-11-28 02:48:30,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:30,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:30,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1632 treesize of output 818 [2024-11-28 02:49:04,480 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0) (let ((.cse5 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse81 (store (store .cse5 v_arrayElimCell_115 v_DerPreprocessor_7) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse81 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse81 v_arrayElimCell_115))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (.cse2 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse80 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (let ((.cse79 (store .cse80 v_arrayElimCell_115 0))) (and (= (select .cse79 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse80 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= (select .cse79 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))))) (.cse16 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0)))) (.cse3 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse78 (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0))) (and (= (select .cse78 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse78 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)))))) (.cse20 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse77 (store .cse5 v_arrayElimCell_115 0))) (and (= (select (let ((.cse76 (store .cse77 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse76 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse76 v_arrayElimCell_115))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse77 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)))))) (.cse26 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse75 (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)))) (let ((.cse74 (store (store .cse75 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0))) (and (= (select (let ((.cse73 (store (store .cse5 v_arrayElimCell_117 (select .cse74 v_arrayElimCell_117)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse73 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse73 v_arrayElimCell_117))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse75 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse74 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115))))))) (.cse13 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (.cse7 (not (= |c_ULTIMATE.start_destroy_~l#1.base| 0))) (.cse1 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 24))) (.cse41 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (or (and .cse1 (or .cse3 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse4 (store .cse5 v_arrayElimCell_115 0))) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_115)) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse4 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse4 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse6 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse6 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))))) (and .cse1 .cse7 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse8 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse8 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse8 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int)) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse9 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115)) (= (select (store .cse9 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (let ((.cse10 (store .cse5 v_arrayElimCell_115 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse10 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse10 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse11 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= (select .cse11 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse11 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select .cse11 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= |c_#valid| (store .cse11 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))))) (and .cse1 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse12 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse12 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select .cse12 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse12 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) .cse13)) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse14 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= 1 (select .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= (select .cse14 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse15 (store (store .cse5 v_arrayElimCell_117 (select .cse14 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse15 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse15 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= |c_#valid| (store .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (and .cse1 (or .cse16 (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_118 Int)) (let ((.cse17 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select .cse17 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select .cse17 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse17 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) v_arrayElimCell_118 (select .cse17 v_arrayElimCell_118)) v_arrayElimCell_115)) v_arrayElimCell_118) 0)))))) (and (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse19 (store (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select (let ((.cse18 (store (store .cse5 v_arrayElimCell_117 (select .cse19 v_arrayElimCell_117)) v_arrayElimCell_118 (select .cse19 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse18 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse18 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse19 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse19 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select .cse19 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) .cse20 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse21 (store (store .cse5 v_arrayElimCell_118 0) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse21 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse21 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse21 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse23 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (= (select (let ((.cse22 (store .cse23 v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse22 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse22 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store .cse23 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse24 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse24 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse25 (store (store .cse5 v_arrayElimCell_115 0) v_arrayElimCell_118 (select .cse24 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse25 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse25 v_arrayElimCell_115))) v_arrayElimCell_118) 0) (= (select .cse24 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) .cse26 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse29 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1)) (.cse27 (select |c_#valid| v_arrayElimCell_118))) (let ((.cse30 (store (store .cse29 v_arrayElimCell_118 .cse27) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_118 .cse27) v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (let ((.cse28 (store .cse29 v_arrayElimCell_118 (select .cse30 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse28 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse28 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= (select .cse30 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select .cse30 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse31 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= 1 (select .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (= |c_#valid| (store .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse31 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_117)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select (let ((.cse32 (store (store .cse5 v_arrayElimCell_117 (select .cse31 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse32 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse32 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0))))) .cse1) (and .cse1 (or .cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse33 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse33 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse34 (store (store .cse5 v_arrayElimCell_115 v_DerPreprocessor_7) v_arrayElimCell_118 (select .cse33 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse34 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse34 v_arrayElimCell_115))) v_arrayElimCell_118) 0) (= (select .cse33 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_118 Int)) (let ((.cse35 (store .cse5 v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse35 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse35 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse35 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_118 Int)) (let ((.cse37 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (let ((.cse38 (store .cse37 v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_118 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (let ((.cse36 (store .cse37 v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse36 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse36 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= 1 (select .cse38 |c_ULTIMATE.start_destroy_~l#1.base|)) (= (select .cse38 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))) (and .cse1 (or .cse2 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse39 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse39 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse39 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse39 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse40 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse40 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse40 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_118 (select .cse40 v_arrayElimCell_118)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) v_arrayElimCell_118) 0) (= (select .cse40 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))))) .cse41) (and .cse1 .cse16) (and (or (and .cse3 .cse1) (and .cse1 .cse7 (or (exists ((v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store .cse5 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1))) (exists ((v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse42 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)))) (let ((.cse43 (store (store .cse42 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= |c_#valid| (store (store .cse42 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse43 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select .cse43 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0))))) (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))))) (and (or .cse3 .cse20 .cse26) .cse1) (and .cse1 .cse13)) .cse41) (and (let ((.cse49 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0))) (or (exists ((v_arrayElimCell_118 Int)) (let ((.cse44 (store .cse5 v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse44 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse44 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (and .cse1 (exists ((v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse45 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse45 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse45 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse46 (store (store .cse5 v_arrayElimCell_115 v_DerPreprocessor_7) v_arrayElimCell_118 (select .cse45 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse46 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse46 v_arrayElimCell_115))) v_arrayElimCell_118) 0))))) (and (exists ((v_DerPreprocessor_16 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_118 Int)) (let ((.cse47 (store (store .cse5 0 v_DerPreprocessor_16) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_118 0) 0 0)) (= (select .cse47 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse48 (store (store .cse5 0 (select .cse47 0)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse48 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse48 0))) v_arrayElimCell_118) 0)))) .cse49) (and .cse1 (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_118 Int)) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select .cse50 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse50 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) v_arrayElimCell_118 (select .cse50 v_arrayElimCell_118)) v_arrayElimCell_115)) v_arrayElimCell_118) 0))))) (and .cse1 .cse7 (or (and .cse49 (exists ((v_DerPreprocessor_14 Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int)) (let ((.cse51 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (not (= v_arrayElimCell_115 0)) (= (select .cse51 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select .cse51 0)) |c_ULTIMATE.start_destroy_~l#1.base| 1) 0)) |c_ULTIMATE.start_destroy_~l#1.base|) 0))))) (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))) (exists ((v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse52 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= |c_#valid| (store .cse52 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse52 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= v_arrayElimCell_117 0)) (= (select .cse52 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (exists ((v_arrayElimCell_115 Int)) (let ((.cse53 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse53 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse53 0 0))))))) (and .cse1 (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (= (select .cse54 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse54 0 0)))))) (and (or (exists ((v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_115)) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse55 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse55 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse55 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0))))) .cse1) (and .cse1 (or (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse56 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_117 0)) (= |c_#valid| (store .cse56 0 0)) (= (select .cse56 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_117)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select (let ((.cse57 (store (store .cse5 v_arrayElimCell_117 (select .cse56 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse57 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse57 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (and .cse49 .cse7 (exists ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse58 (store (store .cse5 0 v_DerPreprocessor_18) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_115 0)) (= (select .cse58 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse59 (store (store .cse5 0 (select .cse58 0)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse59 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse59 0))) v_arrayElimCell_118) 0))))) (and (exists ((v_DerPreprocessor_19 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse60 (select |c_#valid| v_arrayElimCell_118))) (let ((.cse63 (store (store (store .cse5 0 v_DerPreprocessor_19) v_arrayElimCell_118 .cse60) v_arrayElimCell_115 0))) (let ((.cse62 (select .cse63 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_118 .cse60) v_arrayElimCell_115 0) 0 0)) (= (select (let ((.cse61 (store (store .cse5 0 .cse62) v_arrayElimCell_118 (select .cse63 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse61 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse61 0))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= v_DerPreprocessor_19 .cse62) (= (select .cse63 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) .cse49) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse64 (store (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse64 0 0)) (= (select (let ((.cse65 (store (store .cse5 v_arrayElimCell_117 (select .cse64 v_arrayElimCell_117)) v_arrayElimCell_118 (select .cse64 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse65 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse65 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (not (= v_arrayElimCell_117 0)) (= (select .cse64 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse66 (store (store .cse5 v_arrayElimCell_118 0) v_arrayElimCell_115 0))) (and (= |c_#valid| (store .cse66 0 0)) (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse66 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse67 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse67 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse67 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse68 (store (store .cse5 v_arrayElimCell_115 0) v_arrayElimCell_118 (select .cse67 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse68 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse68 v_arrayElimCell_115))) v_arrayElimCell_118) 0)))))) (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse69 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_117 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= (select .cse69 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse69 0 0)) (= (select (let ((.cse70 (store (store .cse5 v_arrayElimCell_117 (select .cse69 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse70 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse70 v_arrayElimCell_117))) v_arrayElimCell_118) 0)))) (and (or (exists ((v_arrayElimCell_115 Int)) (let ((.cse71 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse71 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse71 0 0)) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0)))) (exists ((v_prenex_6 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse72 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse72 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse72 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_118 (select .cse72 v_arrayElimCell_118)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) v_arrayElimCell_118) 0))))) .cse1))) .cse41))))) is different from false [2024-11-28 02:49:12,522 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_destroy_~l#1.base|) 1) (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0) (let ((.cse6 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse3 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (and (= (select (store (store .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (.cse2 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse63 (store .cse6 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)))) (and (= (select (let ((.cse62 (store (store .cse6 v_arrayElimCell_117 (select (store (store .cse63 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) v_arrayElimCell_117)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse62 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse62 v_arrayElimCell_117))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse63 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115)))))) (.cse4 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse61 (store .cse6 v_arrayElimCell_115 0))) (and (= (select (let ((.cse60 (store .cse61 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse60 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse60 v_arrayElimCell_115))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse61 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)))))) (.cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (let ((.cse59 (store (store .cse6 v_arrayElimCell_115 v_DerPreprocessor_7) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse59 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse59 v_arrayElimCell_115))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (.cse12 (not (= |c_ULTIMATE.start_destroy_~l#1.base| 0))) (.cse0 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0))) (.cse1 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 24))) (.cse19 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse58 (store .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (and (= (select (store .cse58 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse58 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))))) (or (and .cse0 (or (and .cse1 (or .cse2 .cse3 .cse4)) (and .cse1 .cse3))) (and .cse0 (let ((.cse11 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse36 (store .cse6 v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse36 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse36 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))))) (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_118 Int)) (let ((.cse5 (store .cse6 v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0)))) (and (or .cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse8 (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse9 (store (store .cse6 v_arrayElimCell_115 v_DerPreprocessor_7) v_arrayElimCell_118 (select .cse8 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse9 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse9 v_arrayElimCell_115))) v_arrayElimCell_118) 0) (= (select .cse8 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))) .cse1) (and .cse1 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse10 (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse10 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse10 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) .cse3 .cse11)) (and .cse1 .cse12 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse13 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= (select .cse13 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse13 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= |c_#valid| (store .cse13 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse14 (store .cse6 v_arrayElimCell_115 0))) (and (= |c_#valid| (store .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (let ((.cse15 (store .cse6 v_arrayElimCell_115 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse15 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse15 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_118 Int)) (let ((.cse17 (store .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_118 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (let ((.cse16 (store .cse17 v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse16 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse16 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= (select (store .cse17 v_arrayElimCell_118 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (and .cse1 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse18 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse18 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= |c_#valid| (store .cse18 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)))))) (and .cse1 (or .cse19 .cse11 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse20 (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse20 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse6 v_arrayElimCell_118 (select .cse20 v_arrayElimCell_118)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) v_arrayElimCell_118) 0) (= (select .cse20 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))))) (and .cse1 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse21 (store (store .cse6 v_arrayElimCell_118 0) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse21 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse21 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0)))) .cse2 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse24 (store .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1)) (.cse22 (select |c_#valid| v_arrayElimCell_118))) (let ((.cse25 (store (store .cse24 v_arrayElimCell_118 .cse22) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store (store (store .cse6 v_arrayElimCell_118 .cse22) v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (let ((.cse23 (store .cse24 v_arrayElimCell_118 (select .cse25 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse23 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse23 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= (select .cse25 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (= (select (let ((.cse26 (store (store .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse26 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse26 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse27 (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse27 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse28 (store (store .cse6 v_arrayElimCell_115 0) v_arrayElimCell_118 (select .cse27 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse28 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse28 v_arrayElimCell_115))) v_arrayElimCell_118) 0) (= (select .cse27 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse30 (store (store (store .cse6 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select (let ((.cse29 (store (store .cse6 v_arrayElimCell_117 (select .cse30 v_arrayElimCell_117)) v_arrayElimCell_118 (select .cse30 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse29 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse29 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse30 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse30 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) .cse4 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse31 (store (store .cse6 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= 1 (select .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (= |c_#valid| (store .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_117)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select (let ((.cse32 (store (store .cse6 v_arrayElimCell_117 (select .cse31 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse32 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse32 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse33 (store (store .cse6 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= 1 (select .cse33 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= (select (let ((.cse34 (store (store .cse6 v_arrayElimCell_117 (select .cse33 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse34 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse34 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (and .cse1 (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_118 Int)) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select .cse35 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= |c_#valid| (store .cse35 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) v_arrayElimCell_118 (select .cse35 v_arrayElimCell_118)) v_arrayElimCell_115)) v_arrayElimCell_118) 0)))))))) (and .cse1 .cse7) (and (let ((.cse38 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse40 (exists ((v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) 0 0)) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))))) (or (and .cse1 (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_118 Int)) (let ((.cse37 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse37 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) v_arrayElimCell_118 (select .cse37 v_arrayElimCell_118)) v_arrayElimCell_115)) v_arrayElimCell_118) 0))))) (and .cse38 (exists ((v_DerPreprocessor_16 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_118 Int)) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store .cse6 v_arrayElimCell_118 0) 0 0)) (= (select (let ((.cse39 (store (store .cse6 0 (select (store (store .cse6 0 v_DerPreprocessor_16) v_arrayElimCell_118 0) 0)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse39 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse39 0))) v_arrayElimCell_118) 0)))) (exists ((v_arrayElimCell_118 Int)) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store .cse6 v_arrayElimCell_118 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0))) (and .cse1 (or .cse40 (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0))))) (and .cse1 (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0) 0 0)))) (and (or (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (and (= |c_#valid| (store (store (store .cse6 v_arrayElimCell_118 0) v_arrayElimCell_115 0) 0 0)) (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0))) (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse41 (store (store .cse6 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_117 0)) (= |c_#valid| (store .cse41 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_117)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select (let ((.cse42 (store (store .cse6 v_arrayElimCell_117 (select .cse41 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse42 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse42 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse43 (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse43 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse44 (store (store .cse6 v_arrayElimCell_115 0) v_arrayElimCell_118 (select .cse43 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse44 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse44 v_arrayElimCell_115))) v_arrayElimCell_118) 0)))) (and .cse38 (exists ((v_DerPreprocessor_19 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse45 (select |c_#valid| v_arrayElimCell_118))) (let ((.cse48 (store (store (store .cse6 0 v_DerPreprocessor_19) v_arrayElimCell_118 .cse45) v_arrayElimCell_115 0))) (let ((.cse47 (select .cse48 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store (store .cse6 v_arrayElimCell_118 .cse45) v_arrayElimCell_115 0) 0 0)) (= (select (let ((.cse46 (store (store .cse6 0 .cse47) v_arrayElimCell_118 (select .cse48 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse46 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse46 0))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= v_DerPreprocessor_19 .cse47))))))) (and .cse38 .cse12 (exists ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_115 0)) (= (select (let ((.cse49 (store (store .cse6 0 (select (store (store .cse6 0 v_DerPreprocessor_18) v_arrayElimCell_115 0) 0)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse49 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse49 0))) v_arrayElimCell_118) 0)))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse50 (store (store (store .cse6 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse50 0 0)) (= (select (let ((.cse51 (store (store .cse6 v_arrayElimCell_117 (select .cse50 v_arrayElimCell_117)) v_arrayElimCell_118 (select .cse50 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse51 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse51 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (not (= v_arrayElimCell_117 0)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0))))) .cse1) (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse52 (store (store .cse6 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_117 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= |c_#valid| (store .cse52 0 0)) (= (select (let ((.cse53 (store (store .cse6 v_arrayElimCell_117 (select .cse52 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse53 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse53 v_arrayElimCell_117))) v_arrayElimCell_118) 0)))) (and (exists ((v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse54 (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse54 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse55 (store (store .cse6 v_arrayElimCell_115 v_DerPreprocessor_7) v_arrayElimCell_118 (select .cse54 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse55 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse55 v_arrayElimCell_115))) v_arrayElimCell_118) 0)))) .cse1) (and (or (exists ((v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse56 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= |c_#valid| (store .cse56 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse56 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= v_arrayElimCell_117 0)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (exists ((v_arrayElimCell_115 Int)) (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) 0 0))) (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (and (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))) (and (exists ((v_DerPreprocessor_14 Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store .cse6 v_arrayElimCell_115 0) 0 0)) (not (= v_arrayElimCell_115 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0) 0)) |c_ULTIMATE.start_destroy_~l#1.base| 1) 0)) |c_ULTIMATE.start_destroy_~l#1.base|) 0))) .cse38)) .cse1 .cse12) (and .cse1 (or .cse40 (exists ((v_prenex_6 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse57 (store (store .cse6 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse57 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse6 v_arrayElimCell_118 (select .cse57 v_arrayElimCell_118)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) v_arrayElimCell_118) 0)))))))) .cse0) (and .cse1 .cse19))))) is different from false [2024-11-28 02:49:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-28 02:49:22,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:49:28,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:49:28,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1524 treesize of output 1424 [2024-11-28 02:53:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804778315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:20,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:53:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2024-11-28 02:53:20,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171083610] [2024-11-28 02:53:20,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:20,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 02:53:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:20,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 02:53:20,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2259, Unknown=53, NotChecked=194, Total=2652 [2024-11-28 02:53:20,687 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 35 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:55:28,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:55:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:44,870 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2024-11-28 02:55:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:55:44,870 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 35 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-28 02:55:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:44,876 INFO L225 Difference]: With dead ends: 200 [2024-11-28 02:55:44,876 INFO L226 Difference]: Without dead ends: 171 [2024-11-28 02:55:44,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 390.4s TimeCoverageRelationStatistics Valid=245, Invalid=3345, Unknown=78, NotChecked=238, Total=3906 [2024-11-28 02:55:44,878 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 56 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 13 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:44,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 914 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1415 Invalid, 4 Unknown, 166 Unchecked, 10.4s Time] [2024-11-28 02:55:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-28 02:55:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-28 02:55:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 165 states have internal predecessors, (189), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:55:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2024-11-28 02:55:44,910 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 47 [2024-11-28 02:55:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:44,910 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2024-11-28 02:55:44,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 35 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:55:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2024-11-28 02:55:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 02:55:44,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:44,912 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:44,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 02:55:45,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 02:55:45,113 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:55:45,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1704999105, now seen corresponding path program 1 times [2024-11-28 02:55:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421327436] [2024-11-28 02:55:45,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:55:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:48,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421327436] [2024-11-28 02:55:48,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421327436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:48,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66842045] [2024-11-28 02:55:48,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:48,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:48,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 02:55:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:48,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 02:55:48,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:48,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:55:48,676 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 02:55:48,743 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 02:55:48,925 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:48,926 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 02:55:49,066 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:49,067 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 02:55:49,230 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:49,230 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 02:55:49,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 31 treesize of output 13 [2024-11-28 02:55:49,298 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 02:55:49,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:55:49,550 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 02:55:49,648 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 02:55:49,655 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 02:55:49,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:49,930 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 02:55:49,937 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 02:55:49,973 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 02:55:49,984 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 02:55:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:55:50,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:50,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_2988 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2988) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2988 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2988) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2989) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:55:50,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2988 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2988) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2989) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) (forall ((v_ArrVal_2988 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2988) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:55:50,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:50,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 02:55:50,349 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 40 treesize of output 28 [2024-11-28 02:55:50,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:50,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-28 02:55:50,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:50,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-28 02:55:50,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:55:50,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-28 02:55:50,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:55:50,403 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 24 treesize of output 12 [2024-11-28 02:55:51,929 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 02:55:51,930 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 58 treesize of output 57 [2024-11-28 02:55:51,940 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem11#1.base| (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2980))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2981)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2982)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2024-11-28 02:55:51,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2980))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2981)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2982)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-28 02:55:51,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:55:51,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2024-11-28 02:55:51,985 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 11644 treesize of output 9706 [2024-11-28 02:55:52,195 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 155 treesize of output 123 [2024-11-28 02:55:52,201 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 123 treesize of output 95 [2024-11-28 02:55:52,206 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 95 treesize of output 87 [2024-11-28 02:55:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-28 02:55:52,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66842045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:52,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:52,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 49 [2024-11-28 02:55:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88990750] [2024-11-28 02:55:52,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:52,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 02:55:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:52,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 02:55:52,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1889, Unknown=21, NotChecked=364, Total=2450 [2024-11-28 02:55:52,419 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 43 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 02:55:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:55:54,997 INFO L93 Difference]: Finished difference Result 170 states and 195 transitions. [2024-11-28 02:55:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:55:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 43 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2024-11-28 02:55:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:55:55,001 INFO L225 Difference]: With dead ends: 170 [2024-11-28 02:55:55,001 INFO L226 Difference]: Without dead ends: 170 [2024-11-28 02:55:55,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=272, Invalid=2479, Unknown=21, NotChecked=420, Total=3192 [2024-11-28 02:55:55,005 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:55:55,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1204 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 830 Invalid, 0 Unknown, 154 Unchecked, 1.8s Time] [2024-11-28 02:55:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-28 02:55:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-28 02:55:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 164 states have internal predecessors, (187), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:55:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2024-11-28 02:55:55,026 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 54 [2024-11-28 02:55:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:55:55,026 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2024-11-28 02:55:55,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 43 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 02:55:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2024-11-28 02:55:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 02:55:55,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:55:55,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:55,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-28 02:55:55,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:55,233 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:55:55,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1682854626, now seen corresponding path program 1 times [2024-11-28 02:55:55,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:55,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495776624] [2024-11-28 02:55:55,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495776624] [2024-11-28 02:55:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495776624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268636186] [2024-11-28 02:55:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:57,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:57,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:57,312 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:57,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 02:55:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:57,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-28 02:55:57,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:58,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:55:58,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:55:58,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 02:55:58,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:55:58,474 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 02:55:58,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:55:58,597 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 02:55:58,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:55:58,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 02:55:58,948 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:55:58,949 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 02:55:58,956 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 28 treesize of output 11 [2024-11-28 02:55:59,001 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 20 treesize of output 8 [2024-11-28 02:55:59,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-28 02:55:59,520 INFO L349 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2024-11-28 02:55:59,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 26 [2024-11-28 02:56:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:56:00,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:56:02,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:02,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 112 [2024-11-28 02:56:02,107 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 207 treesize of output 183 [2024-11-28 02:56:02,120 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 97 treesize of output 85 [2024-11-28 02:56:04,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268636186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:04,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:56:04,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 34 [2024-11-28 02:56:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635053890] [2024-11-28 02:56:04,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:56:04,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 02:56:04,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:04,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 02:56:04,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1978, Unknown=16, NotChecked=0, Total=2162 [2024-11-28 02:56:04,784 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 31 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:06,950 INFO L93 Difference]: Finished difference Result 199 states and 231 transitions. [2024-11-28 02:56:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:56:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 31 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-28 02:56:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:06,952 INFO L225 Difference]: With dead ends: 199 [2024-11-28 02:56:06,952 INFO L226 Difference]: Without dead ends: 199 [2024-11-28 02:56:06,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=304, Invalid=2986, Unknown=16, NotChecked=0, Total=3306 [2024-11-28 02:56:06,954 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 51 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:06,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1075 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 02:56:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-28 02:56:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 172. [2024-11-28 02:56:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 148 states have (on average 1.277027027027027) internal successors, (189), 166 states have internal predecessors, (189), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2024-11-28 02:56:06,961 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 54 [2024-11-28 02:56:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:06,962 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2024-11-28 02:56:06,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 31 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2024-11-28 02:56:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 02:56:06,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:06,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:06,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 02:56:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:07,168 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:56:07,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash 628885993, now seen corresponding path program 1 times [2024-11-28 02:56:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480357799] [2024-11-28 02:56:07,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:56:08,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:08,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480357799] [2024-11-28 02:56:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480357799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:08,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217837171] [2024-11-28 02:56:08,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:08,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:08,940 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:08,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 02:56:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:09,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-28 02:56:09,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:09,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:56:09,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:09,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 02:56:09,804 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 9 treesize of output 5 [2024-11-28 02:56:09,916 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:56:09,916 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 02:56:09,930 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 18 treesize of output 13 [2024-11-28 02:56:10,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:10,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 13 [2024-11-28 02:56:10,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:10,262 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 40 treesize of output 39 [2024-11-28 02:56:10,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:10,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-28 02:56:10,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:10,581 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 40 treesize of output 39 [2024-11-28 02:56:11,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:11,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 02:56:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:56:11,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:56:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217837171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:12,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:56:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2024-11-28 02:56:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871842514] [2024-11-28 02:56:12,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:56:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 02:56:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:12,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 02:56:12,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1940, Unknown=26, NotChecked=0, Total=2162 [2024-11-28 02:56:12,584 INFO L87 Difference]: Start difference. First operand 172 states and 197 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 31 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:14,482 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2024-11-28 02:56:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:56:14,484 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 31 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-28 02:56:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:14,485 INFO L225 Difference]: With dead ends: 198 [2024-11-28 02:56:14,485 INFO L226 Difference]: Without dead ends: 198 [2024-11-28 02:56:14,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=321, Invalid=2845, Unknown=26, NotChecked=0, Total=3192 [2024-11-28 02:56:14,487 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 61 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:14,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 773 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 02:56:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-28 02:56:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2024-11-28 02:56:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 168 states have internal predecessors, (191), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2024-11-28 02:56:14,499 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 55 [2024-11-28 02:56:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:14,502 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2024-11-28 02:56:14,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 31 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2024-11-28 02:56:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 02:56:14,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:14,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:14,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 02:56:14,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:14,710 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:56:14,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash 556360734, now seen corresponding path program 1 times [2024-11-28 02:56:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941358451] [2024-11-28 02:56:14,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:56:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941358451] [2024-11-28 02:56:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941358451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338291175] [2024-11-28 02:56:16,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:16,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:16,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:16,590 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:16,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 02:56:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:16,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 02:56:16,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:17,342 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:56:17,342 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 02:56:17,468 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 02:56:17,759 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:17,759 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 02:56:17,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:17,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:56:18,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:18,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:56:18,378 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 02:56:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:56:18,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:56:18,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3510 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_3510) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:56:18,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3510 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_3510) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))))) is different from false [2024-11-28 02:56:18,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3509))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_3510)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:56:18,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3508))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3509)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3510))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:56:18,969 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3508))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3509)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3510))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:56:18,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:18,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 61 [2024-11-28 02:56:19,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:19,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1446 treesize of output 1181 [2024-11-28 02:56:19,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:19,087 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 350 treesize of output 318 [2024-11-28 02:56:19,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:19,112 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 310 treesize of output 234 [2024-11-28 02:56:19,123 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 226 treesize of output 210 [2024-11-28 02:56:22,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338291175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:22,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:56:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 35 [2024-11-28 02:56:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957031080] [2024-11-28 02:56:22,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:56:22,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 02:56:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:22,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 02:56:22,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1474, Unknown=19, NotChecked=410, Total=2070 [2024-11-28 02:56:22,659 INFO L87 Difference]: Start difference. First operand 174 states and 199 transitions. Second operand has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 32 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:24,596 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2024-11-28 02:56:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:56:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 32 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-28 02:56:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:24,598 INFO L225 Difference]: With dead ends: 179 [2024-11-28 02:56:24,598 INFO L226 Difference]: Without dead ends: 179 [2024-11-28 02:56:24,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=267, Invalid=2182, Unknown=21, NotChecked=500, Total=2970 [2024-11-28 02:56:24,600 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 20 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:24,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 959 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 02:56:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-28 02:56:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-28 02:56:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 155 states have (on average 1.270967741935484) internal successors, (197), 173 states have internal predecessors, (197), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2024-11-28 02:56:24,606 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 55 [2024-11-28 02:56:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:24,607 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2024-11-28 02:56:24,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 32 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2024-11-28 02:56:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 02:56:24,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:24,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:24,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-28 02:56:24,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:24,813 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:56:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 556360735, now seen corresponding path program 1 times [2024-11-28 02:56:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:24,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21826619] [2024-11-28 02:56:24,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:56:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:26,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21826619] [2024-11-28 02:56:26,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21826619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376553308] [2024-11-28 02:56:26,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:26,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:26,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:26,872 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:26,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 02:56:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:27,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-28 02:56:27,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:27,446 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 02:56:27,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:56:27,599 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 02:56:27,660 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 02:56:27,675 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 02:56:27,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:27,872 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 02:56:27,878 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 02:56:28,030 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:28,030 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 02:56:28,036 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 02:56:28,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:28,172 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 02:56:28,183 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 02:56:28,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 31 treesize of output 13 [2024-11-28 02:56:28,506 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 02:56:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:56:28,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:56:29,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_3682) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)))) (forall ((v_ArrVal_3681 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:56:29,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3680))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3679) .cse0 v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 16) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3682) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3679) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3680) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 8))))) is different from false [2024-11-28 02:56:29,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3680))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3679) .cse1 v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_3682) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))) (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3679) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3680) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 8)))))) is different from false [2024-11-28 02:56:29,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) (.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3677))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3678) .cse0 v_ArrVal_3679) (select (select (store .cse1 .cse0 v_ArrVal_3680) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_3681))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 8))) (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3677))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3680))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3678) .cse4 v_ArrVal_3679) .cse5 v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 16) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_3682) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 02:56:29,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3677))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3678) .cse1 v_ArrVal_3679) (select (select (store .cse2 .cse1 v_ArrVal_3680) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_3681))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 8))) (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int)) (v_ArrVal_3677 (Array Int Int)) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3677))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3680))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3678) .cse5 v_ArrVal_3679) .cse6 v_ArrVal_3681) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 16) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_3682) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))))))))))) is different from false [2024-11-28 02:56:29,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:29,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2024-11-28 02:56:29,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:29,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2024-11-28 02:56:29,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 332 [2024-11-28 02:56:29,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:29,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 538 treesize of output 519 [2024-11-28 02:56:29,550 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 278 treesize of output 246 [2024-11-28 02:56:29,557 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 276 treesize of output 248 [2024-11-28 02:56:29,565 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 222 treesize of output 214 [2024-11-28 02:56:29,573 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 214 treesize of output 206 [2024-11-28 02:56:29,581 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 206 treesize of output 174 [2024-11-28 02:56:29,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:29,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-11-28 02:56:29,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:29,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2024-11-28 02:56:29,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:56:29,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:56:29,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:29,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1042 treesize of output 664 [2024-11-28 02:56:29,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:56:29,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:29,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2024-11-28 02:56:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376553308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:30,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:56:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2024-11-28 02:56:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598731895] [2024-11-28 02:56:30,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:56:30,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 02:56:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:30,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 02:56:30,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1623, Unknown=27, NotChecked=430, Total=2256 [2024-11-28 02:56:30,170 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 31 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:31,747 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2024-11-28 02:56:31,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:56:31,748 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 31 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-28 02:56:31,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:31,749 INFO L225 Difference]: With dead ends: 179 [2024-11-28 02:56:31,749 INFO L226 Difference]: Without dead ends: 179 [2024-11-28 02:56:31,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=263, Invalid=2179, Unknown=28, NotChecked=500, Total=2970 [2024-11-28 02:56:31,751 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:31,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 939 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 02:56:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-28 02:56:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-28 02:56:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 155 states have (on average 1.264516129032258) internal successors, (196), 173 states have internal predecessors, (196), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-28 02:56:31,759 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 55 [2024-11-28 02:56:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:31,760 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-28 02:56:31,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 31 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:56:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-28 02:56:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 02:56:31,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:31,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:31,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-28 02:56:31,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-28 02:56:31,963 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:56:31,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1345090622, now seen corresponding path program 1 times [2024-11-28 02:56:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753823013] [2024-11-28 02:56:31,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:56:33,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:33,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753823013] [2024-11-28 02:56:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753823013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:33,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864156591] [2024-11-28 02:56:33,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:33,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:33,586 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:33,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 02:56:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:33,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 02:56:33,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:34,078 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:56:34,078 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 02:56:34,127 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 02:56:34,254 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:34,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:56:34,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:34,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:56:34,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:34,434 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 02:56:34,452 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 02:56:34,494 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 02:56:34,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:56:34,773 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 02:56:34,880 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 02:56:34,885 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 02:56:35,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:35,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 62 treesize of output 57 [2024-11-28 02:56:35,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 02:56:35,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:56:35,241 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 02:56:35,247 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 02:56:35,275 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 02:56:35,283 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 02:56:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:56:35,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:56:35,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int))) (<= (+ 32 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3923) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))) (forall ((v_ArrVal_3922 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) 24))))) is different from false [2024-11-28 02:56:35,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int))) (<= (+ 32 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3923) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) (forall ((v_ArrVal_3922 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 24)))))) is different from false [2024-11-28 02:56:35,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3920))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ 32 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3921) .cse0 v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3923) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_ArrVal_3922 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3921) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3920) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 24))))) is different from false [2024-11-28 02:56:35,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_ArrVal_3922 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3921) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3920) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 24))) (forall ((v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3921 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3920))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3921) .cse2 v_ArrVal_3922) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 32) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3923) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))))) is different from false [2024-11-28 02:56:35,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:35,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-28 02:56:35,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:35,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-28 02:56:35,614 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 64 treesize of output 52 [2024-11-28 02:56:35,620 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 134 treesize of output 116 [2024-11-28 02:56:35,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-28 02:56:35,630 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 10 [2024-11-28 02:56:35,635 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 13 treesize of output 9 [2024-11-28 02:56:35,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:35,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-28 02:56:35,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:35,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-28 02:56:35,665 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:56:35,669 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 92 treesize of output 56 [2024-11-28 02:56:35,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:56:35,675 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 24 treesize of output 12 [2024-11-28 02:56:36,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3914 (Array Int Int))) (not (= 0 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_3914) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))))) is different from false [2024-11-28 02:56:36,722 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 02:56:36,722 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 58 treesize of output 57 [2024-11-28 02:56:36,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3912 (Array Int Int)) (v_ArrVal_3913 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3912))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3913)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3914)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) |c_ULTIMATE.start_create_#t~mem11#1.base|)) is different from false [2024-11-28 02:56:36,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:36,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2024-11-28 02:56:36,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2144 treesize of output 1730 [2024-11-28 02:56:36,904 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 25 treesize of output 21 [2024-11-28 02:56:36,908 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 121 treesize of output 93 [2024-11-28 02:56:36,911 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 93 treesize of output 69 [2024-11-28 02:56:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2024-11-28 02:56:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864156591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:56:37,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:56:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 23] total 52 [2024-11-28 02:56:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015824180] [2024-11-28 02:56:37,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:56:37,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 02:56:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:37,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 02:56:37,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1964, Unknown=25, NotChecked=570, Total=2756 [2024-11-28 02:56:37,051 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 46 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 02:56:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:39,065 INFO L93 Difference]: Finished difference Result 178 states and 202 transitions. [2024-11-28 02:56:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:56:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 46 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-11-28 02:56:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:39,066 INFO L225 Difference]: With dead ends: 178 [2024-11-28 02:56:39,066 INFO L226 Difference]: Without dead ends: 178 [2024-11-28 02:56:39,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=297, Invalid=2564, Unknown=25, NotChecked=654, Total=3540 [2024-11-28 02:56:39,068 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:39,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1354 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 799 Invalid, 0 Unknown, 247 Unchecked, 1.3s Time] [2024-11-28 02:56:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-28 02:56:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-28 02:56:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 172 states have internal predecessors, (194), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 202 transitions. [2024-11-28 02:56:39,073 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 202 transitions. Word has length 57 [2024-11-28 02:56:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:39,073 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 202 transitions. [2024-11-28 02:56:39,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 46 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 02:56:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 202 transitions. [2024-11-28 02:56:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 02:56:39,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:39,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:39,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 02:56:39,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-28 02:56:39,279 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:56:39,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1979370556, now seen corresponding path program 1 times [2024-11-28 02:56:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:39,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557226032] [2024-11-28 02:56:39,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:56:41,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:41,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557226032] [2024-11-28 02:56:41,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557226032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:41,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353077714] [2024-11-28 02:56:41,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:41,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:41,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:41,010 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:41,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 02:56:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:41,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-28 02:56:41,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:41,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:56:41,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:56:41,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:56:42,049 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))) (not (= alloc_and_zero_~pi~0.base 0)))) is different from true [2024-11-28 02:56:42,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:56:42,364 INFO L349 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2024-11-28 02:56:42,364 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 1 case distinctions, treesize of input 65 treesize of output 53 [2024-11-28 02:56:42,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:56:42,381 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 02:56:42,781 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 20 treesize of output 8 [2024-11-28 02:56:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-28 02:56:42,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:56:43,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:56:43,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 48 [2024-11-28 02:56:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353077714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:44,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:56:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 35 [2024-11-28 02:56:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371176747] [2024-11-28 02:56:44,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:56:44,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 02:56:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:44,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 02:56:44,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1759, Unknown=1, NotChecked=84, Total=1980 [2024-11-28 02:56:44,388 INFO L87 Difference]: Start difference. First operand 178 states and 202 transitions. Second operand has 35 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 31 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:47,621 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2024-11-28 02:56:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 02:56:47,622 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 31 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2024-11-28 02:56:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:47,623 INFO L225 Difference]: With dead ends: 176 [2024-11-28 02:56:47,623 INFO L226 Difference]: Without dead ends: 176 [2024-11-28 02:56:47,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=355, Invalid=3808, Unknown=1, NotChecked=126, Total=4290 [2024-11-28 02:56:47,626 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 138 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:47,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 730 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1057 Invalid, 0 Unknown, 128 Unchecked, 1.5s Time] [2024-11-28 02:56:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-28 02:56:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-28 02:56:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 168 states have internal predecessors, (189), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 197 transitions. [2024-11-28 02:56:47,638 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 197 transitions. Word has length 56 [2024-11-28 02:56:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:47,639 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 197 transitions. [2024-11-28 02:56:47,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 31 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:56:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 197 transitions. [2024-11-28 02:56:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 02:56:47,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:47,640 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:47,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 02:56:47,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-28 02:56:47,841 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:56:47,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash -709290069, now seen corresponding path program 2 times [2024-11-28 02:56:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406383464] [2024-11-28 02:56:47,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:56:47,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:47,932 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:56:47,933 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:56:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406383464] [2024-11-28 02:56:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406383464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:51,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817298702] [2024-11-28 02:56:51,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:56:51,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:51,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:51,288 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:51,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c229d90-1366-4564-8aac-b9b94e58f039/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 02:56:51,781 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:56:51,781 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:51,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-28 02:56:51,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:52,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:56:52,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:56:52,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:56:52,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 02:56:52,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:56:52,444 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 02:56:52,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-28 02:56:52,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 02:56:52,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:52,973 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-28 02:56:52,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 81 [2024-11-28 02:56:52,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:53,031 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-11-28 02:56:53,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2024-11-28 02:56:53,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:53,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:53,624 INFO L349 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2024-11-28 02:56:53,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 101 [2024-11-28 02:56:53,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:53,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 69 [2024-11-28 02:56:54,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:54,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:54,080 INFO L349 Elim1Store]: treesize reduction 63, result has 19.2 percent of original size [2024-11-28 02:56:54,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 144 treesize of output 109 [2024-11-28 02:56:54,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:54,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:56:54,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 69 [2024-11-28 02:56:55,824 INFO L349 Elim1Store]: treesize reduction 24, result has 73.0 percent of original size [2024-11-28 02:56:55,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 132 treesize of output 138 [2024-11-28 02:56:55,963 INFO L349 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2024-11-28 02:56:55,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 72 treesize of output 104 [2024-11-28 02:56:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:56:57,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:59:32,184 WARN L286 SmtUtils]: Spent 19.05s on a formula simplification. DAG size of input: 201 DAG size of output: 113 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 02:59:32,184 INFO L349 Elim1Store]: treesize reduction 12985, result has 29.6 percent of original size [2024-11-28 02:59:32,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 10433254947 treesize of output 9848630601 [2024-11-28 02:59:59,723 WARN L286 SmtUtils]: Spent 27.43s on a formula simplification. DAG size of input: 8457 DAG size of output: 2341 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)