./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:35:24,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:35:24,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:35:24,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:35:24,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:35:24,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:35:24,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:35:24,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:35:24,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:35:24,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:35:24,583 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:35:24,584 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:35:24,584 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:35:24,585 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:35:24,586 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:35:24,586 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:35:24,587 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:35:24,587 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:35:24,588 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:35:24,589 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:35:24,590 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:35:24,594 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:35:24,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:35:24,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:35:24,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:35:24,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:35:24,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:35:24,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:35:24,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:35:24,598 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:35:24,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:35:24,602 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:35:24,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:35:24,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:35:24,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:35:24,604 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:35:24,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:35:24,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:35:24,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:35:24,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:35:24,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:35:24,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:35:24,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:35:24,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:35:24,609 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:35:24,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:35:24,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:35:24,610 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:35:24,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:35:24,611 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 [2024-11-09 05:35:25,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:35:25,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:35:25,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:35:25,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:35:25,059 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:35:25,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i Unable to find full path for "g++" [2024-11-09 05:35:27,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:35:28,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:35:28,043 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2024-11-09 05:35:28,068 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/data/a0d408b13/4769e4686f234da8ac8a7063f6e63632/FLAGb1bcf4beb [2024-11-09 05:35:28,094 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/data/a0d408b13/4769e4686f234da8ac8a7063f6e63632 [2024-11-09 05:35:28,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:35:28,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:35:28,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:35:28,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:35:28,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:35:28,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c345cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28, skipping insertion in model container [2024-11-09 05:35:28,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:35:28,681 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:35:28,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:35:28,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:35:28,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:35:28,841 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:35:28,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28 WrapperNode [2024-11-09 05:35:28,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:35:28,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:35:28,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:35:28,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:35:28,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,905 INFO L138 Inliner]: procedures = 119, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-09 05:35:28,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:35:28,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:35:28,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:35:28,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:35:28,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:35:28,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:35:28,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:35:28,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:35:28,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (1/1) ... [2024-11-09 05:35:28,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:35:28,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:29,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:35:29,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:35:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:35:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:35:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:35:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:35:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:35:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:35:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:35:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:35:29,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:35:29,199 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:35:29,202 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:35:29,472 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-09 05:35:29,472 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:35:29,555 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:35:29,555 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:35:29,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:35:29 BoogieIcfgContainer [2024-11-09 05:35:29,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:35:29,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:35:29,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:35:29,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:35:29,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:35:28" (1/3) ... [2024-11-09 05:35:29,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c6b76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:35:29, skipping insertion in model container [2024-11-09 05:35:29,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:28" (2/3) ... [2024-11-09 05:35:29,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c6b76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:35:29, skipping insertion in model container [2024-11-09 05:35:29,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:35:29" (3/3) ... [2024-11-09 05:35:29,570 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2024-11-09 05:35:29,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:35:29,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-09 05:35:29,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:35:29,680 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=FINITE_AUTOMATA, 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;@6e505d89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:35:29,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 05:35:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:35:29,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:29,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:35:29,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash 96320, now seen corresponding path program 1 times [2024-11-09 05:35:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585847603] [2024-11-09 05:35:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:29,929 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-09 05:35:29,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585847603] [2024-11-09 05:35:29,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585847603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:29,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:29,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:35:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96566373] [2024-11-09 05:35:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:29,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:35:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:29,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:35:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:35:29,984 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:30,094 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-09 05:35:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:35:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 05:35:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:30,108 INFO L225 Difference]: With dead ends: 33 [2024-11-09 05:35:30,108 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:35:30,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-09 05:35:30,118 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:30,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:35:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:35:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 2.0) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-09 05:35:30,168 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 3 [2024-11-09 05:35:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:30,168 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-09 05:35:30,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-09 05:35:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:35:30,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:30,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:35:30,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:35:30,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:30,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash 96326, now seen corresponding path program 1 times [2024-11-09 05:35:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492981654] [2024-11-09 05:35:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:30,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:30,358 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-09 05:35:30,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:30,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492981654] [2024-11-09 05:35:30,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492981654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:30,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:30,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:35:30,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473000165] [2024-11-09 05:35:30,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:30,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:35:30,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:35:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:35:30,365 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:30,433 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-09 05:35:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:35:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 05:35:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:30,435 INFO L225 Difference]: With dead ends: 38 [2024-11-09 05:35:30,436 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 05:35:30,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:35:30,438 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:30,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 32 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 05:35:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-09 05:35:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-09 05:35:30,447 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 3 [2024-11-09 05:35:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:30,448 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 05:35:30,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 05:35:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:35:30,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:30,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:35:30,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:35:30,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:30,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash 96327, now seen corresponding path program 1 times [2024-11-09 05:35:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627373679] [2024-11-09 05:35:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:30,686 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-09 05:35:30,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627373679] [2024-11-09 05:35:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627373679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:35:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131862776] [2024-11-09 05:35:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:30,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:35:30,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:35:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:35:30,696 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:30,832 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-09 05:35:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:35:30,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 05:35:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:30,833 INFO L225 Difference]: With dead ends: 37 [2024-11-09 05:35:30,834 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 05:35:30,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:35:30,836 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:30,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 05:35:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-09 05:35:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 05:35:30,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 3 [2024-11-09 05:35:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:30,843 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 05:35:30,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 05:35:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:35:30,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:30,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:35:30,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:35:30,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash 92568793, now seen corresponding path program 1 times [2024-11-09 05:35:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798743499] [2024-11-09 05:35:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:30,928 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-09 05:35:30,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798743499] [2024-11-09 05:35:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798743499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:30,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:30,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:35:30,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827281794] [2024-11-09 05:35:30,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:30,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:35:30,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:30,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:35:30,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:35:30,931 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:30,990 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-09 05:35:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:35:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 05:35:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:30,992 INFO L225 Difference]: With dead ends: 37 [2024-11-09 05:35:30,992 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 05:35:30,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:35:30,994 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:30,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:35:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 05:35:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-09 05:35:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-09 05:35:31,006 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 5 [2024-11-09 05:35:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:31,007 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-09 05:35:31,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-09 05:35:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:35:31,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:31,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:31,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:35:31,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:31,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:31,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1235686997, now seen corresponding path program 1 times [2024-11-09 05:35:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233695917] [2024-11-09 05:35:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:31,162 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-09 05:35:31,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:31,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233695917] [2024-11-09 05:35:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233695917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:35:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168299390] [2024-11-09 05:35:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:31,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:35:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:31,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:35:31,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:35:31,165 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:31,265 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-09 05:35:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:35:31,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:35:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:31,267 INFO L225 Difference]: With dead ends: 36 [2024-11-09 05:35:31,267 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 05:35:31,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:35:31,269 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:31,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 40 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 05:35:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-09 05:35:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-09 05:35:31,275 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 7 [2024-11-09 05:35:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-09 05:35:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-09 05:35:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:35:31,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:31,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:31,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:35:31,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:31,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1235686996, now seen corresponding path program 1 times [2024-11-09 05:35:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822650324] [2024-11-09 05:35:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:31,512 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-09 05:35:31,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:31,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822650324] [2024-11-09 05:35:31,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822650324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:31,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:31,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:35:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705585705] [2024-11-09 05:35:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:31,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:35:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:31,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:35:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:35:31,516 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:31,620 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-09 05:35:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:35:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:35:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:31,623 INFO L225 Difference]: With dead ends: 34 [2024-11-09 05:35:31,624 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 05:35:31,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:35:31,625 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:31,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 55 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 05:35:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 05:35:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-09 05:35:31,634 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 7 [2024-11-09 05:35:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:31,635 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-09 05:35:31,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-09 05:35:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:35:31,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:31,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:31,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:35:31,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2054738451, now seen corresponding path program 1 times [2024-11-09 05:35:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885275018] [2024-11-09 05:35:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:31,747 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-09 05:35:31,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885275018] [2024-11-09 05:35:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885275018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:35:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257560089] [2024-11-09 05:35:31,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:31,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:35:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:31,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:35:31,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:35:31,754 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:31,793 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-09 05:35:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:35:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:35:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:31,795 INFO L225 Difference]: With dead ends: 31 [2024-11-09 05:35:31,795 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:35:31,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:35:31,797 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:31,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:35:31,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:35:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:35:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.65) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-09 05:35:31,801 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 9 [2024-11-09 05:35:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:31,802 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-09 05:35:31,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-09 05:35:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:35:31,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:31,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:31,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:35:31,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2084183075, now seen corresponding path program 1 times [2024-11-09 05:35:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732309871] [2024-11-09 05:35:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:32,045 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-09 05:35:32,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:32,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732309871] [2024-11-09 05:35:32,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732309871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:32,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:32,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:35:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309580325] [2024-11-09 05:35:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:32,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:35:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:32,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:35:32,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:35:32,050 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:32,172 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-09 05:35:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:35:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:35:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:32,174 INFO L225 Difference]: With dead ends: 34 [2024-11-09 05:35:32,175 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 05:35:32,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:35:32,176 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:32,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 05:35:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-09 05:35:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.6) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-09 05:35:32,190 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 9 [2024-11-09 05:35:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:32,191 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-09 05:35:32,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-09 05:35:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:35:32,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:32,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:32,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:35:32,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:32,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2084183074, now seen corresponding path program 1 times [2024-11-09 05:35:32,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:32,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760806688] [2024-11-09 05:35:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:32,616 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-09 05:35:32,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:32,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760806688] [2024-11-09 05:35:32,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760806688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:32,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:32,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:35:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929406256] [2024-11-09 05:35:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:32,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:35:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:35:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:35:32,620 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:32,833 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-09 05:35:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:35:32,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:35:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:32,839 INFO L225 Difference]: With dead ends: 36 [2024-11-09 05:35:32,839 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 05:35:32,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:35:32,840 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:32,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 05:35:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-11-09 05:35:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-09 05:35:32,851 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 9 [2024-11-09 05:35:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:32,851 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-09 05:35:32,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-09 05:35:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:35:32,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:32,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:32,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:35:32,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:32,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -185165873, now seen corresponding path program 1 times [2024-11-09 05:35:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050449702] [2024-11-09 05:35:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:33,254 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-09 05:35:33,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050449702] [2024-11-09 05:35:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050449702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:35:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663874542] [2024-11-09 05:35:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:33,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:35:33,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:33,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:35:33,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:35:33,258 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:33,414 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-09 05:35:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:35:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:35:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:33,415 INFO L225 Difference]: With dead ends: 36 [2024-11-09 05:35:33,415 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 05:35:33,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:35:33,416 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:33,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 05:35:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-09 05:35:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.608695652173913) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-09 05:35:33,448 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2024-11-09 05:35:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:33,448 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-09 05:35:33,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-09 05:35:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:35:33,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:33,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:33,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:35:33,451 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:33,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -185165872, now seen corresponding path program 1 times [2024-11-09 05:35:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178370667] [2024-11-09 05:35:33,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:33,876 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-09 05:35:33,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178370667] [2024-11-09 05:35:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178370667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:35:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351902622] [2024-11-09 05:35:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:33,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:35:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:35:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:35:33,881 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:34,037 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-09 05:35:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:35:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:35:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:34,038 INFO L225 Difference]: With dead ends: 40 [2024-11-09 05:35:34,038 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 05:35:34,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:35:34,040 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:34,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 69 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 05:35:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-09 05:35:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-09 05:35:34,047 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 10 [2024-11-09 05:35:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:34,047 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-09 05:35:34,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-09 05:35:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:35:34,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:34,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:34,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:35:34,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:34,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:34,050 INFO L85 PathProgramCache]: Analyzing trace with hash -185157707, now seen corresponding path program 1 times [2024-11-09 05:35:34,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:34,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589388893] [2024-11-09 05:35:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:34,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:34,131 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-09 05:35:34,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589388893] [2024-11-09 05:35:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589388893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:34,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:35:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710573559] [2024-11-09 05:35:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:34,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:35:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:35:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:35:34,134 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:34,164 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-09 05:35:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:35:34,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:35:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:34,167 INFO L225 Difference]: With dead ends: 36 [2024-11-09 05:35:34,167 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 05:35:34,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:35:34,169 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:34,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:35:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 05:35:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 05:35:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.5) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-09 05:35:34,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2024-11-09 05:35:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:34,178 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-09 05:35:34,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-09 05:35:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:35:34,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:34,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:34,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:35:34,179 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash -421908753, now seen corresponding path program 1 times [2024-11-09 05:35:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:34,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013393475] [2024-11-09 05:35:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:34,287 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-09 05:35:34,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013393475] [2024-11-09 05:35:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013393475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386827964] [2024-11-09 05:35:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:34,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:34,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:34,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:34,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:35:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:34,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:35:34,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:34,494 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-09 05:35:34,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:34,567 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 05:35:34,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-09 05:35:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:35:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386827964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:35:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [722561737] [2024-11-09 05:35:34,628 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 05:35:34,628 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:35:34,633 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:35:34,640 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:35:34,641 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:35:36,975 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:35:53,421 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1021#(and (= ~ind~0 0) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#a~0#1.base_19| Int)) (and (<= 2 |v_ULTIMATE.start_main_~#a~0#1.base_19|) (not (= (select |#valid| |v_ULTIMATE.start_main_~#a~0#1.base_19|) 1)))) (<= ~num~0 99) (= ~i~0 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 1 ~num~0) (<= ~num~0 ~newsize~0) (exists ((|v_#memory_$Pointer$.offset_35| (Array Int (Array Int Int))) (|v_ULTIMATE.start_expandArray_~pointer#1.base_20| Int) (|v_#memory_$Pointer$.offset_36| (Array Int (Array Int Int))) (|v_#memory_int_29| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_35| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_36| (Array Int (Array Int Int)))) (and (<= 4 (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0))) (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) 1) (= (select |#valid| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 1) (<= (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0))) (<= 4 (select |#length| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|)) (= |#memory_int| (store (store |v_#memory_int_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0) (store (select |v_#memory_int_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_20| (store (select (store |v_#memory_int_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0) (store (select |v_#memory_int_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0 (select (select |#memory_int| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_36| |v_ULTIMATE.start_expandArray_~pointer#1.base_20| (store (select |v_#memory_$Pointer$.base_36| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)))) (= (store |v_#memory_$Pointer$.base_35| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0) (store (select |v_#memory_$Pointer$.base_35| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (select (select |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0))))) |v_#memory_$Pointer$.base_36|) (= (store |v_#memory_$Pointer$.offset_35| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0) (store (select |v_#memory_$Pointer$.offset_35| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (select (select |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0))))) |v_#memory_$Pointer$.offset_36|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_36| |v_ULTIMATE.start_expandArray_~pointer#1.base_20| (store (select |v_#memory_$Pointer$.offset_36| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_20|) 0)))))))' at error location [2024-11-09 05:35:53,422 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:35:53,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:35:53,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-09 05:35:53,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795053417] [2024-11-09 05:35:53,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:35:53,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:35:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:35:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=198, Unknown=4, NotChecked=0, Total=240 [2024-11-09 05:35:53,424 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:53,627 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-09 05:35:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:35:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:35:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:53,629 INFO L225 Difference]: With dead ends: 35 [2024-11-09 05:35:53,629 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 05:35:53,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=42, Invalid=226, Unknown=4, NotChecked=0, Total=272 [2024-11-09 05:35:53,630 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:53,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 05:35:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 05:35:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-09 05:35:53,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2024-11-09 05:35:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:53,635 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-09 05:35:53,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-09 05:35:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:35:53,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:53,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:53,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:35:53,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:53,837 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:35:53,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash -421908752, now seen corresponding path program 1 times [2024-11-09 05:35:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59567329] [2024-11-09 05:35:53,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:54,218 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-09 05:35:54,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59567329] [2024-11-09 05:35:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59567329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652488146] [2024-11-09 05:35:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:54,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:54,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:35:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:54,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:35:54,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:54,681 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-09 05:35:54,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:54,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:54,789 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-09 05:35:55,007 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-09 05:35:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652488146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:35:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [70116921] [2024-11-09 05:35:55,010 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 05:35:55,011 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:35:55,011 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:35:55,011 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:35:55,011 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:35:56,739 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:36:10,593 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1192#(and (exists ((|v_ULTIMATE.start_main_~#a~0#1.offset_18| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.base_23| Int) (|v_ULTIMATE.start_main_~#a~0#1.base_21| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.offset_21| Int)) (and (= |v_ULTIMATE.start_main_~#a~0#1.offset_18| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)) 1) (= ~ind~0 0) (<= 1 |#StackHeapBarrier|) (= |v_ULTIMATE.start_expandArray_~pointer#1.offset_21| 0) (<= (select |#length| |v_ULTIMATE.start_main_~#a~0#1.base_21|) 3) (<= 4 (select |#length| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|)) (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0))) (<= ~num~0 99) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_expandArray_~pointer#1.base_23| (store (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)))) (= (store |v_#memory_$Pointer$.base_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4) (- 4)) (select (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4) (- 4))))) |v_#memory_$Pointer$.base_52|))) (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_expandArray_~pointer#1.base_23| (store (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)))) (= (store |v_#memory_$Pointer$.offset_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4) (- 4)) (select (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4) (- 4))))) |v_#memory_$Pointer$.offset_52|))) (<= 4 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4))) (= ~i~0 1) (exists ((|v_#memory_int_45| (Array Int (Array Int Int)))) (= |#memory_int| (store (store |v_#memory_int_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (store (select |v_#memory_int_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_23| (store (select (store |v_#memory_int_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (store (select |v_#memory_int_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0) (* ~newsize~0 4) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0 (select (select |#memory_int| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|) 0))))) (= 1 (select |#valid| |v_ULTIMATE.start_expandArray_~pointer#1.base_23|)) (<= 2 |v_ULTIMATE.start_main_~#a~0#1.base_21|) (<= 1 ~num~0))) (<= ~num~0 ~newsize~0))' at error location [2024-11-09 05:36:10,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:36:10,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:36:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 05:36:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267151311] [2024-11-09 05:36:10,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:36:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:36:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:36:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=2, NotChecked=0, Total=420 [2024-11-09 05:36:10,596 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:10,860 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-09 05:36:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:36:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:36:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:10,861 INFO L225 Difference]: With dead ends: 33 [2024-11-09 05:36:10,862 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 05:36:10,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=91, Invalid=369, Unknown=2, NotChecked=0, Total=462 [2024-11-09 05:36:10,863 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:10,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:36:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 05:36:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-11-09 05:36:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-09 05:36:10,867 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 14 [2024-11-09 05:36:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:10,868 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-09 05:36:10,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-09 05:36:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:36:10,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:10,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:36:10,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:36:11,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:11,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:36:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -194269428, now seen corresponding path program 1 times [2024-11-09 05:36:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821084342] [2024-11-09 05:36:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:11,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821084342] [2024-11-09 05:36:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821084342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616397408] [2024-11-09 05:36:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:11,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:36:11,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:36:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:11,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:36:11,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:12,050 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 05:36:12,051 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 179 [2024-11-09 05:36:12,085 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 130 [2024-11-09 05:36:12,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:12,196 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-11-09 05:36:12,403 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-09 05:36:12,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:12,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:12,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-09 05:36:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:12,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:12,747 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 28 treesize of output 24 [2024-11-09 05:36:13,037 INFO L349 Elim1Store]: treesize reduction 18, result has 64.0 percent of original size [2024-11-09 05:36:13,037 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 197 [2024-11-09 05:36:13,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:13,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 144 [2024-11-09 05:36:13,148 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 7 treesize of output 3 [2024-11-09 05:36:13,175 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:36:13,429 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-09 05:36:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616397408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:36:13,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1565268765] [2024-11-09 05:36:13,433 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 05:36:13,433 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:36:13,433 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:36:13,434 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:36:13,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:36:14,900 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:36:29,354 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1366#(and (exists ((|v_ULTIMATE.start_main_~#a~0#1.offset_21| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.base_26| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.offset_24| Int)) (and (= ~ind~0 0) (<= 1 |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) 0) |ULTIMATE.start_main_#t~mem8#1.base|) (exists ((|v_#memory_$Pointer$.base_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (store (select |v_#memory_$Pointer$.base_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (- 4)) (select (select |v_#memory_$Pointer$.base_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (- 4))))) |v_#memory_$Pointer$.base_66|) (= (store |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_expandArray_~pointer#1.base_26| (store (select |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0))) |#memory_$Pointer$.base|))) (<= 4 (select |#length| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|)) (<= (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0))) (<= ~num~0 99) (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_expandArray_~pointer#1.base_26| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)))) (= (store |v_#memory_$Pointer$.offset_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (store (select |v_#memory_$Pointer$.offset_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (- 4)) (select (select |v_#memory_$Pointer$.offset_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (- 4))))) |v_#memory_$Pointer$.offset_67|))) (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) (= ~i~0 1) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (= (select |#valid| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 1) (= |v_ULTIMATE.start_main_~#a~0#1.offset_21| 0) (exists ((|v_#memory_int_59| (Array Int (Array Int Int)))) (= |#memory_int| (store (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_26| (store (select (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0 (select (select |#memory_int| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0))))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) 0) 0)) (<= 1 ~num~0) (= |v_ULTIMATE.start_expandArray_~pointer#1.offset_24| 0) (<= 4 (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_26|) 0))))) (= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1) (<= ~num~0 ~newsize~0))' at error location [2024-11-09 05:36:29,355 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:36:29,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:36:29,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-09 05:36:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173295523] [2024-11-09 05:36:29,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:36:29,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:36:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:36:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=560, Unknown=2, NotChecked=0, Total=650 [2024-11-09 05:36:29,361 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:30,471 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-11-09 05:36:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:36:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:36:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:30,473 INFO L225 Difference]: With dead ends: 29 [2024-11-09 05:36:30,473 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 05:36:30,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=140, Invalid=788, Unknown=2, NotChecked=0, Total=930 [2024-11-09 05:36:30,475 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:30,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:36:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 05:36:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 05:36:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-09 05:36:30,480 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 15 [2024-11-09 05:36:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:30,480 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-09 05:36:30,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-09 05:36:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:36:30,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:30,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:36:30,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:36:30,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 05:36:30,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:36:30,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -223714051, now seen corresponding path program 1 times [2024-11-09 05:36:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104994926] [2024-11-09 05:36:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:31,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104994926] [2024-11-09 05:36:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104994926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096899268] [2024-11-09 05:36:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:31,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:31,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:31,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:36:31,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:36:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:31,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 05:36:31,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:31,812 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 7 treesize of output 3 [2024-11-09 05:36:31,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:36:31,837 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 7 treesize of output 3 [2024-11-09 05:36:31,848 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 3 [2024-11-09 05:36:32,072 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-09 05:36:32,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:36:32,370 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:36:32,370 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 1 case distinctions, treesize of input 36 treesize of output 31 [2024-11-09 05:36:32,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:32,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2024-11-09 05:36:32,398 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 7 [2024-11-09 05:36:32,414 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 12 treesize of output 8 [2024-11-09 05:36:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:32,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:32,772 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 8 treesize of output 4 [2024-11-09 05:36:32,912 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 7 treesize of output 3 [2024-11-09 05:36:34,701 INFO L349 Elim1Store]: treesize reduction 18, result has 64.0 percent of original size [2024-11-09 05:36:34,702 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 197 [2024-11-09 05:36:34,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:34,743 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 144 [2024-11-09 05:36:34,829 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 7 treesize of output 3 [2024-11-09 05:36:34,916 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 8 treesize of output 4 [2024-11-09 05:36:35,526 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 137 treesize of output 117 [2024-11-09 05:36:35,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:35,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 234 [2024-11-09 05:36:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096899268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:36:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1637485298] [2024-11-09 05:36:36,332 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 05:36:36,333 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:36:36,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:36:36,334 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:36:36,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:36:37,221 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:36:46,870 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1553#(and (= ~ind~0 0) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_expandArray_~pointer#1.base|) (= |ULTIMATE.start_expandArray_~pointer#1.offset| 0) (<= ~num~0 99) (= ~i~0 1) (<= 1 ~newsize~0) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 1 ~num~0))' at error location [2024-11-09 05:36:46,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:36:46,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:36:46,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-09 05:36:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47849288] [2024-11-09 05:36:46,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:36:46,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 05:36:46,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:46,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 05:36:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=748, Unknown=1, NotChecked=0, Total=930 [2024-11-09 05:36:46,874 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:50,490 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-09 05:36:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 05:36:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:36:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:50,492 INFO L225 Difference]: With dead ends: 80 [2024-11-09 05:36:50,492 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 05:36:50,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=393, Invalid=1586, Unknown=1, NotChecked=0, Total=1980 [2024-11-09 05:36:50,494 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 192 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:50,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 107 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 05:36:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 05:36:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 46. [2024-11-09 05:36:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.425) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-11-09 05:36:50,517 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 15 [2024-11-09 05:36:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:50,518 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-09 05:36:50,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-09 05:36:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:36:50,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:50,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:36:50,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 05:36:50,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 05:36:50,724 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:36:50,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1727384881, now seen corresponding path program 1 times [2024-11-09 05:36:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771210045] [2024-11-09 05:36:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:51,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771210045] [2024-11-09 05:36:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771210045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16552479] [2024-11-09 05:36:51,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:51,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:51,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:51,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:36:51,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:36:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:51,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 05:36:51,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:51,721 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 05:36:51,722 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 179 [2024-11-09 05:36:51,740 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 130 [2024-11-09 05:36:51,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:51,834 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-11-09 05:36:51,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 05:36:52,120 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-09 05:36:52,779 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-09 05:36:52,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 53 [2024-11-09 05:36:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:53,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:53,311 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 28 treesize of output 24 [2024-11-09 05:36:53,629 INFO L349 Elim1Store]: treesize reduction 18, result has 64.0 percent of original size [2024-11-09 05:36:53,630 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 197 [2024-11-09 05:36:53,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:53,672 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 144 [2024-11-09 05:36:53,709 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 8 treesize of output 4 [2024-11-09 05:36:53,816 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:36:54,179 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-09 05:36:54,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16552479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:36:54,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1245870317] [2024-11-09 05:36:54,183 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:36:54,183 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:36:54,183 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:36:54,184 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:36:54,184 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:36:55,322 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:37:11,933 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1820#(and (exists ((|v_ULTIMATE.start_main_~#a~0#1.offset_24| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.offset_28| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.base_30| Int)) (and (= ~ind~0 0) (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) (<= 1 |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) 0) 0) (<= (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0))) (<= |#StackHeapBarrier| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= ~num~0 99) (= (select |#valid| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) 1) (= |v_ULTIMATE.start_main_~#a~0#1.offset_24| 0) (= ~i~0 1) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_97| (store |v_#memory_$Pointer$.offset_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0) (store (select |v_#memory_$Pointer$.offset_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (select (select |v_#memory_$Pointer$.offset_97| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| |v_ULTIMATE.start_expandArray_~pointer#1.base_30| (store (select |v_#memory_$Pointer$.offset_97| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)))))) (= |v_ULTIMATE.start_expandArray_~pointer#1.offset_28| 0) (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_98| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_97| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0) (store (select |v_#memory_$Pointer$.base_97| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (select (select |v_#memory_$Pointer$.base_98| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0))))) |v_#memory_$Pointer$.base_98|) (= (store |v_#memory_$Pointer$.base_98| |v_ULTIMATE.start_expandArray_~pointer#1.base_30| (store (select |v_#memory_$Pointer$.base_98| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0))) |#memory_$Pointer$.base|))) (<= 4 (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0))) (<= 1 ~num~0) (<= 4 (select |#length| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|)) (exists ((|v_#memory_int_89| (Array Int (Array Int Int)))) (= |#memory_int| (store (store |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0) (store (select |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_30| (store (select (store |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0) (store (select |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) (+ (* ~newsize~0 4) (- 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0 (select (select |#memory_int| |v_ULTIMATE.start_expandArray_~pointer#1.base_30|) 0))))))) (= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1) (<= ~num~0 ~newsize~0))' at error location [2024-11-09 05:37:11,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:37:11,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:37:11,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 05:37:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412938270] [2024-11-09 05:37:11,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:37:11,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:37:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:37:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=661, Unknown=2, NotChecked=0, Total=756 [2024-11-09 05:37:11,936 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:13,041 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-11-09 05:37:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:37:13,042 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:37:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:13,042 INFO L225 Difference]: With dead ends: 45 [2024-11-09 05:37:13,043 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 05:37:13,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=127, Invalid=801, Unknown=2, NotChecked=0, Total=930 [2024-11-09 05:37:13,044 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:13,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:37:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 05:37:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 05:37:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.4) internal successors, (56), 44 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-11-09 05:37:13,049 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 16 [2024-11-09 05:37:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:13,049 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-09 05:37:13,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-11-09 05:37:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:37:13,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:13,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:13,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 05:37:13,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 05:37:13,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:37:13,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1654798992, now seen corresponding path program 1 times [2024-11-09 05:37:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:13,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270939830] [2024-11-09 05:37:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:37:13,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270939830] [2024-11-09 05:37:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270939830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542844344] [2024-11-09 05:37:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:37:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:37:13,979 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:37:13,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:37:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:14,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 05:37:14,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:14,293 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 7 treesize of output 3 [2024-11-09 05:37:14,303 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 3 [2024-11-09 05:37:14,312 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 7 treesize of output 3 [2024-11-09 05:37:14,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:37:14,487 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-09 05:37:14,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:37:14,969 INFO L349 Elim1Store]: treesize reduction 59, result has 28.0 percent of original size [2024-11-09 05:37:14,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 187 [2024-11-09 05:37:14,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 130 [2024-11-09 05:37:15,053 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 7 treesize of output 3 [2024-11-09 05:37:15,132 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 8 treesize of output 4 [2024-11-09 05:37:15,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:37:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:37:15,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-09 05:37:15,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-11-09 05:37:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:37:15,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:37:15,779 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 8 treesize of output 4 [2024-11-09 05:37:15,942 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 7 treesize of output 3 [2024-11-09 05:37:17,376 INFO L349 Elim1Store]: treesize reduction 18, result has 64.0 percent of original size [2024-11-09 05:37:17,376 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 197 [2024-11-09 05:37:17,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:37:17,422 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 144 [2024-11-09 05:37:17,535 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 7 treesize of output 3 [2024-11-09 05:37:17,564 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 8 treesize of output 4 [2024-11-09 05:37:18,269 INFO L349 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2024-11-09 05:37:18,270 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 4 case distinctions, treesize of input 193 treesize of output 209 [2024-11-09 05:37:18,285 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 185 treesize of output 173 [2024-11-09 05:37:18,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:37:18,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 226 [2024-11-09 05:37:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:37:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542844344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:37:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748229028] [2024-11-09 05:37:20,911 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 05:37:20,911 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:37:20,911 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:37:20,911 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:37:20,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:37:21,772 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:37:36,438 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2036#(and (= ~ind~0 0) (= (select |#valid| |ULTIMATE.start_expandArray_~temp~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_expandArray_~pointer#1.offset| 0) (<= ~num~0 99) (<= (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset|) (select |#length| |ULTIMATE.start_expandArray_~temp~0#1.base|)) (exists ((|v_#memory_int_109| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_109| |ULTIMATE.start_expandArray_~temp~0#1.base| (store (select |v_#memory_int_109| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4)) 1)))) (= ~i~0 1) (exists ((|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_118| |ULTIMATE.start_expandArray_~temp~0#1.base| (store (select |v_#memory_$Pointer$.base_118| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4))))))) (<= 1 ~newsize~0) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_expandArray_~pointer#1.base_32| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_expandArray_~pointer#1.base_32|) 1)) (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_32|))) (<= 4 (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset|)) (exists ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_expandArray_~temp~0#1.base| (store (select |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4))))))) (<= 1 ~num~0))' at error location [2024-11-09 05:37:36,438 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:37:36,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:37:36,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-11-09 05:37:36,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772757735] [2024-11-09 05:37:36,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:37:36,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 05:37:36,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 05:37:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=562, Unknown=3, NotChecked=0, Total=650 [2024-11-09 05:37:36,441 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:37,329 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-09 05:37:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:37:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:37:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:37,330 INFO L225 Difference]: With dead ends: 44 [2024-11-09 05:37:37,330 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 05:37:37,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=138, Invalid=729, Unknown=3, NotChecked=0, Total=870 [2024-11-09 05:37:37,331 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:37,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 44 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:37:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 05:37:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 05:37:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.325) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-09 05:37:37,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 16 [2024-11-09 05:37:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:37,335 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-09 05:37:37,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-09 05:37:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:37:37,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:37,337 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:37,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 05:37:37,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 05:37:37,538 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:37:37,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1654798993, now seen corresponding path program 1 times [2024-11-09 05:37:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723583600] [2024-11-09 05:37:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:37:38,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723583600] [2024-11-09 05:37:38,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723583600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117873745] [2024-11-09 05:37:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:38,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:37:38,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:37:38,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:37:38,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:37:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:38,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:37:38,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:39,078 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 05:37:39,079 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 179 [2024-11-09 05:37:39,160 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 05:37:39,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 140 [2024-11-09 05:37:39,253 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 8 treesize of output 4 [2024-11-09 05:37:39,358 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 51 treesize of output 31 [2024-11-09 05:37:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:37:39,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:37:39,673 INFO L349 Elim1Store]: treesize reduction 18, result has 64.0 percent of original size [2024-11-09 05:37:39,674 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 197 [2024-11-09 05:37:39,720 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 8 treesize of output 4 [2024-11-09 05:37:39,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:37:39,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-09 05:37:40,226 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 38 [2024-11-09 05:37:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:37:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117873745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:37:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367507259] [2024-11-09 05:37:40,715 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 05:37:40,715 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:37:40,716 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:37:40,716 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:37:40,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:37:41,421 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:37:54,101 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2249#(and (= ~ind~0 0) (= (select |#valid| |ULTIMATE.start_expandArray_~temp~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_137| |ULTIMATE.start_expandArray_~temp~0#1.base| (store (select |v_#memory_$Pointer$.base_137| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4))))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_128| (Array Int (Array Int Int)))) (= (store |v_#memory_int_128| |ULTIMATE.start_expandArray_~temp~0#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4)) 1)) |#memory_int|)) (<= ~num~0 99) (<= (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset|) (select |#length| |ULTIMATE.start_expandArray_~temp~0#1.base|)) (= ~i~0 1) (<= 1 ~newsize~0) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_expandArray_~pointer#1.base_34| Int)) (and (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_34|) (<= (select |#length| |v_ULTIMATE.start_expandArray_~pointer#1.base_34|) 3))) (<= 4 (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset|)) (<= 1 ~num~0) (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_135| |ULTIMATE.start_expandArray_~temp~0#1.base| (store (select |v_#memory_$Pointer$.offset_135| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_expandArray_~temp~0#1.base|) (+ (* ~newsize~0 4) |ULTIMATE.start_expandArray_~temp~0#1.offset| (- 4))))))))' at error location [2024-11-09 05:37:54,101 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:37:54,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:37:54,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2024-11-09 05:37:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521474613] [2024-11-09 05:37:54,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:37:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 05:37:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:54,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 05:37:54,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=593, Unknown=2, NotChecked=0, Total=702 [2024-11-09 05:37:54,104 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:54,905 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-09 05:37:54,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:37:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:37:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:54,906 INFO L225 Difference]: With dead ends: 43 [2024-11-09 05:37:54,906 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 05:37:54,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=168, Invalid=760, Unknown=2, NotChecked=0, Total=930 [2024-11-09 05:37:54,908 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:54,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 55 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:37:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 05:37:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 05:37:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-11-09 05:37:54,912 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 16 [2024-11-09 05:37:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:54,912 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-11-09 05:37:54,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-11-09 05:37:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:37:54,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:54,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:54,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:37:55,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:37:55,118 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:37:55,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2009323666, now seen corresponding path program 1 times [2024-11-09 05:37:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:55,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408993078] [2024-11-09 05:37:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:55,473 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-09 05:37:55,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408993078] [2024-11-09 05:37:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408993078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604120257] [2024-11-09 05:37:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:37:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:37:55,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:37:55,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:37:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:55,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:37:55,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:56,078 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-09 05:37:56,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:37:56,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:37:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 05:37:56,354 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-09 05:37:56,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:37:56,418 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 32 treesize of output 28 [2024-11-09 05:37:56,824 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-09 05:37:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604120257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:37:56,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [409164492] [2024-11-09 05:37:56,827 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 05:37:56,827 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:37:56,828 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:37:56,828 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:37:56,828 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:37:57,776 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:38:18,153 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2462#(and (exists ((|v_ULTIMATE.start_expandArray_~pointer#1.base_37| Int) (|v_ULTIMATE.start_main_~#a~0#1.offset_29| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.offset_34| Int)) (and (= ~ind~0 0) (exists ((|v_#memory_$Pointer$.offset_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (store (select |v_#memory_$Pointer$.offset_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4) (- 4)) (select (select |v_#memory_$Pointer$.offset_149| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4) (- 4))))) |v_#memory_$Pointer$.offset_149|) (= (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_expandArray_~pointer#1.base_37| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0))) |#memory_$Pointer$.offset|))) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_141| (Array Int (Array Int Int)))) (= |#memory_int| (store (store |v_#memory_int_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (store (select |v_#memory_int_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_37| (store (select (store |v_#memory_int_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (store (select |v_#memory_int_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0 (select (select |#memory_int| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0))))) (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) 0) 0) (= |v_ULTIMATE.start_expandArray_~pointer#1.offset_34| 0) (= (select |#valid| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 1) (<= ~num~0 99) (exists ((|v_#memory_$Pointer$.base_152| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_151| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (store (select |v_#memory_$Pointer$.base_151| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4) (- 4)) (select (select |v_#memory_$Pointer$.base_152| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4) (- 4))))) |v_#memory_$Pointer$.base_152|) (= (store |v_#memory_$Pointer$.base_152| |v_ULTIMATE.start_expandArray_~pointer#1.base_37| (store (select |v_#memory_$Pointer$.base_152| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0))) |#memory_$Pointer$.base|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) 0) 1) |#StackHeapBarrier|) (<= 4 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4))) (= ~i~0 1) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0) (* ~newsize~0 4)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0))) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) 0)) 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) 0) 0)) (<= 4 (select |#length| |v_ULTIMATE.start_expandArray_~pointer#1.base_37|)) (= |v_ULTIMATE.start_main_~#a~0#1.offset_29| 0) (<= 1 ~num~0))) (= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1) (<= ~num~0 ~newsize~0))' at error location [2024-11-09 05:38:18,153 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:38:18,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:38:18,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2024-11-09 05:38:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801104958] [2024-11-09 05:38:18,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:38:18,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:38:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:38:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:38:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=659, Unknown=3, NotChecked=0, Total=756 [2024-11-09 05:38:18,156 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:18,557 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-09 05:38:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:38:18,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 05:38:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:18,559 INFO L225 Difference]: With dead ends: 42 [2024-11-09 05:38:18,559 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 05:38:18,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=103, Invalid=706, Unknown=3, NotChecked=0, Total=812 [2024-11-09 05:38:18,560 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:18,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 35 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:38:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 05:38:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 05:38:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-09 05:38:18,563 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2024-11-09 05:38:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:18,564 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-09 05:38:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-09 05:38:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 05:38:18,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:18,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:38:18,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 05:38:18,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:38:18,773 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:38:18,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2135475890, now seen corresponding path program 1 times [2024-11-09 05:38:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:38:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613835059] [2024-11-09 05:38:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:38:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:19,557 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-09 05:38:19,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:38:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613835059] [2024-11-09 05:38:19,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613835059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:38:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410607961] [2024-11-09 05:38:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:19,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:38:19,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:38:19,559 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:38:19,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:38:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:19,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 05:38:19,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:20,517 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 173 [2024-11-09 05:38:20,548 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:38:20,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:38:20,646 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 58 [2024-11-09 05:38:21,004 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-09 05:38:21,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:38:21,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2024-11-09 05:38:21,836 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-09 05:38:21,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:38:21,910 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 48 treesize of output 44 [2024-11-09 05:38:24,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:24,451 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 146 [2024-11-09 05:38:24,493 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 7 treesize of output 3 [2024-11-09 05:38:24,552 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 8 treesize of output 4 [2024-11-09 05:38:27,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:27,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 358 treesize of output 354 [2024-11-09 05:38:28,632 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-09 05:38:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410607961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:38:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2131185997] [2024-11-09 05:38:28,635 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 05:38:28,635 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:38:28,635 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:38:28,635 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:38:28,635 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:38:29,521 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:38:53,971 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2683#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int)) (|v_ULTIMATE.start_main_~#a~0#1.base_29| Int) (|v_ULTIMATE.start_main_~#a~0#1.offset_33| Int) (|v_ULTIMATE.start_expandArray_~pointer#1.offset_37| Int) (|v_#valid_122| (Array Int Int)) (|v_ULTIMATE.start_expandArray_~pointer#1.base_40| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|)) (<= (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0))) (= ~ind~0 0) (exists ((|v_#memory_int_155| (Array Int (Array Int Int)))) (= |#memory_int| (store (store |v_#memory_int_155| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (store (select |v_#memory_int_155| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_40| (store (select (store |v_#memory_int_155| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (store (select |v_#memory_int_155| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (- 4)) 1)) |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0 (select (select |#memory_int| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0))))) (<= 1 |#StackHeapBarrier|) (= (select |v_#valid_122| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 1) (<= 2 |v_ULTIMATE.start_main_~#a~0#1.base_29|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#a~0#1.base_29|) 0) 0) (= |v_ULTIMATE.start_expandArray_~pointer#1.offset_37| 0) (<= 4 (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0))) (= (store (store |v_#valid_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#a~0#1.base_29|) 0) 0) |v_ULTIMATE.start_main_~#a~0#1.base_29| 0) |#valid|) (<= ~num~0 99) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#a~0#1.base_29|) 0) 1) |#StackHeapBarrier|) (<= 2 |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) (or (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#a~0#1.base_29|) 0) 0) (= (select |v_#valid_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#a~0#1.base_29|) 0)) 1)) (= (select |v_#valid_122| |v_ULTIMATE.start_main_~#a~0#1.base_29|) 1) (exists ((|v_#memory_$Pointer$.offset_162| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_163| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_163| |v_ULTIMATE.start_expandArray_~pointer#1.base_40| (store (select |v_#memory_$Pointer$.offset_163| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)))) (= |v_#memory_$Pointer$.offset_163| (store |v_#memory_$Pointer$.offset_162| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (store (select |v_#memory_$Pointer$.offset_162| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (- 4)) (select (select |v_#memory_$Pointer$.offset_163| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (- 4)))))))) (= ~i~0 1) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#a~0#1.base_29|)) (= |v_ULTIMATE.start_main_~#a~0#1.offset_33| 0) (= (select |v_#valid_122| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) 1) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|)) (<= 1 ~num~0) (exists ((|v_#memory_$Pointer$.base_167| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_166| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (store (select |v_#memory_$Pointer$.base_166| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (- 4)) (select (select |v_#memory_$Pointer$.base_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0)) (+ (* ~newsize~0 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0) (- 4))))) |v_#memory_$Pointer$.base_167|) (= (store |v_#memory_$Pointer$.base_167| |v_ULTIMATE.start_expandArray_~pointer#1.base_40| (store (select |v_#memory_$Pointer$.base_167| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_expandArray_~pointer#1.base_40|) 0))) |#memory_$Pointer$.base|))))) (<= ~num~0 ~newsize~0) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 05:38:53,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:38:53,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:38:53,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2024-11-09 05:38:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519465858] [2024-11-09 05:38:53,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:38:53,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 05:38:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:38:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 05:38:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1009, Unknown=5, NotChecked=0, Total=1122 [2024-11-09 05:38:53,973 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:54,926 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-09 05:38:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:38:54,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 05:38:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:54,928 INFO L225 Difference]: With dead ends: 41 [2024-11-09 05:38:54,928 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 05:38:54,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=118, Invalid=1067, Unknown=5, NotChecked=0, Total=1190 [2024-11-09 05:38:54,929 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:54,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:38:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 05:38:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 05:38:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-11-09 05:38:54,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 18 [2024-11-09 05:38:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:54,936 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2024-11-09 05:38:54,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-11-09 05:38:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 05:38:54,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:54,940 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2024-11-09 05:38:54,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 05:38:55,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:38:55,140 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 05:38:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash -199478054, now seen corresponding path program 2 times [2024-11-09 05:38:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:38:55,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316774973] [2024-11-09 05:38:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:38:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:38:57,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:38:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316774973] [2024-11-09 05:38:57,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316774973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:38:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868129094] [2024-11-09 05:38:57,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:38:57,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:38:57,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:38:57,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:38:57,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 05:38:57,824 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 05:38:57,824 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:38:57,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:38:57,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:58,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:38:58,208 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 3 [2024-11-09 05:38:58,218 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 7 treesize of output 3 [2024-11-09 05:38:58,236 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 7 treesize of output 3 [2024-11-09 05:38:58,938 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 05:38:58,938 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 179 [2024-11-09 05:38:58,959 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 130 [2024-11-09 05:38:59,031 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 8 treesize of output 4 [2024-11-09 05:38:59,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 51 treesize of output 31 [2024-11-09 05:38:59,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 05:38:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 05:38:59,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:38:59,635 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 8 treesize of output 4 [2024-11-09 05:38:59,668 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 8 treesize of output 4 [2024-11-09 05:38:59,750 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 29 treesize of output 21 [2024-11-09 05:38:59,770 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 11 treesize of output 7 [2024-11-09 05:39:02,866 INFO L349 Elim1Store]: treesize reduction 18, result has 64.0 percent of original size [2024-11-09 05:39:02,866 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 197 [2024-11-09 05:39:02,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:39:02,911 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 144 [2024-11-09 05:39:02,962 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 7 treesize of output 3 [2024-11-09 05:39:03,067 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 8 treesize of output 4 [2024-11-09 05:39:03,519 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 142 treesize of output 126 [2024-11-09 05:39:03,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:39:03,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 582 treesize of output 686 [2024-11-09 05:39:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 05:39:05,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868129094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:39:05,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552432018] [2024-11-09 05:39:05,807 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 05:39:05,807 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:39:05,808 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:39:05,808 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:39:05,808 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:39:06,682 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:39:18,380 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2994#(and (= ~ind~0 0) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_expandArray_~pointer#1.base|) (= |ULTIMATE.start_expandArray_~pointer#1.offset| 0) (<= ~num~0 99) (= ~i~0 1) (<= 1 ~newsize~0) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 1 ~num~0))' at error location [2024-11-09 05:39:18,381 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:39:18,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:39:18,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2024-11-09 05:39:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409394011] [2024-11-09 05:39:18,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:39:18,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 05:39:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:39:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 05:39:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1012, Unknown=1, NotChecked=0, Total=1190 [2024-11-09 05:39:18,384 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:39:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:22,860 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-11-09 05:39:22,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 05:39:22,862 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 05:39:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:22,862 INFO L225 Difference]: With dead ends: 41 [2024-11-09 05:39:22,863 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 05:39:22,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=469, Invalid=2610, Unknown=1, NotChecked=0, Total=3080 [2024-11-09 05:39:22,865 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:22,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 05:39:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 05:39:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 05:39:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:39:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 05:39:22,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2024-11-09 05:39:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:22,866 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 05:39:22,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:39:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 05:39:22,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 05:39:22,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-11-09 05:39:22,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-09 05:39:22,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-09 05:39:22,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-09 05:39:22,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-09 05:39:22,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-09 05:39:22,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-09 05:39:22,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-09 05:39:22,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-09 05:39:22,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-09 05:39:22,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (3 of 14 remaining) [2024-11-09 05:39:22,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (2 of 14 remaining) [2024-11-09 05:39:22,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (1 of 14 remaining) [2024-11-09 05:39:22,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2024-11-09 05:39:22,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 05:39:23,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:39:23,076 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:39:23,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:39:23,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:39:23 BoogieIcfgContainer [2024-11-09 05:39:23,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:39:23,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:39:23,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:39:23,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:39:23,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:35:29" (3/4) ... [2024-11-09 05:39:23,088 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 05:39:23,098 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-09 05:39:23,098 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-09 05:39:23,099 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 05:39:23,099 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 05:39:23,225 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 05:39:23,229 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/witness.yml [2024-11-09 05:39:23,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:39:23,230 INFO L158 Benchmark]: Toolchain (without parser) took 235129.48ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 149.2MB in the beginning and 148.9MB in the end (delta: 231.2kB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. [2024-11-09 05:39:23,230 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 182.5MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:39:23,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.70ms. Allocated memory is still 182.5MB. Free memory was 149.2MB in the beginning and 129.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 05:39:23,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.62ms. Allocated memory is still 182.5MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:39:23,231 INFO L158 Benchmark]: Boogie Preprocessor took 52.40ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 126.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:39:23,231 INFO L158 Benchmark]: RCFGBuilder took 597.23ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 106.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 05:39:23,232 INFO L158 Benchmark]: TraceAbstraction took 233523.79ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 106.1MB in the beginning and 154.2MB in the end (delta: -48.1MB). Peak memory consumption was 117.6MB. Max. memory is 16.1GB. [2024-11-09 05:39:23,232 INFO L158 Benchmark]: Witness Printer took 145.17ms. Allocated memory is still 346.0MB. Free memory was 154.2MB in the beginning and 148.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 05:39:23,233 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 182.5MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.70ms. Allocated memory is still 182.5MB. Free memory was 149.2MB in the beginning and 129.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.62ms. Allocated memory is still 182.5MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.40ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 126.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 597.23ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 106.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 233523.79ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 106.1MB in the beginning and 154.2MB in the end (delta: -48.1MB). Peak memory consumption was 117.6MB. Max. memory is 16.1GB. * Witness Printer took 145.17ms. Allocated memory is still 346.0MB. Free memory was 154.2MB in the beginning and 148.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 233.4s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 635 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 1084 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 711 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1701 IncrementalHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 373 mSDtfsCounter, 1701 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 331 SyntacticMatches, 4 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2599 ImplicationChecksByTransitivity, 177.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=16, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 62 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 46.7s InterpolantComputationTime, 433 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 565 ConstructedInterpolants, 48 QuantifiedInterpolants, 9178 SizeOfPredicates, 142 NumberOfNonLiveVariables, 1311 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 42 InterpolantComputations, 12 PerfectInterpolantSequences, 79/237 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 05:39:23,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d7bf3ae-1028-4fbb-af6c-d02f6559afc1/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE