./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ --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 e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:11:06,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:11:06,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 05:11:06,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:11:06,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:11:06,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:11:06,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:11:06,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:11:06,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:11:06,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:11:06,779 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:11:06,779 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:11:06,780 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:11:06,780 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:11:06,781 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:11:06,781 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:11:06,782 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:11:06,782 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:11:06,783 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:11:06,783 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:11:06,784 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:11:06,784 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:11:06,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:11:06,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:11:06,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:11:06,786 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:11:06,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:11:06,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:11:06,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:11:06,788 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:11:06,788 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:11:06,789 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:11:06,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:11:06,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:11:06,790 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:11:06,790 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:11:06,791 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:11:06,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:11:06,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:11:06,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:11:06,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:11:06,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:11:06,793 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:11:06,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:11:06,794 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:11:06,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:11:06,794 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_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/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_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ 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 -> e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f [2023-11-19 05:11:07,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:11:07,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:11:07,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:11:07,077 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:11:07,077 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:11:07,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-ext-properties/list-ext_1.i [2023-11-19 05:11:10,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:11:10,610 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:11:10,611 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/sv-benchmarks/c/list-ext-properties/list-ext_1.i [2023-11-19 05:11:10,625 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/data/5634dbbac/71cd280fa7834412a5d6be97c85aa168/FLAGc60b904f9 [2023-11-19 05:11:10,640 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/data/5634dbbac/71cd280fa7834412a5d6be97c85aa168 [2023-11-19 05:11:10,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:11:10,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:11:10,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:11:10,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:11:10,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:11:10,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:11:10" (1/1) ... [2023-11-19 05:11:10,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f539bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:10, skipping insertion in model container [2023-11-19 05:11:10,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:11:10" (1/1) ... [2023-11-19 05:11:10,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:11:11,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:11:11,064 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:11:11,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:11:11,164 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:11:11,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11 WrapperNode [2023-11-19 05:11:11,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:11:11,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:11:11,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:11:11,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:11:11,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,252 INFO L138 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 132 [2023-11-19 05:11:11,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:11:11,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:11:11,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:11:11,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:11:11,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:11:11,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:11:11,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:11:11,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:11:11,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (1/1) ... [2023-11-19 05:11:11,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:11:11,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:11:11,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:11:11,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:11:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-19 05:11:11,424 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-19 05:11:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:11:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:11:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:11:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:11:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:11:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:11:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:11:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:11:11,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:11:11,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:11:11,549 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:11:11,551 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:11:11,590 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-19 05:11:12,003 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:11:12,122 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:11:12,122 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-19 05:11:12,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:11:12 BoogieIcfgContainer [2023-11-19 05:11:12,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:11:12,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:11:12,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:11:12,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:11:12,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:11:10" (1/3) ... [2023-11-19 05:11:12,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5e1c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:11:12, skipping insertion in model container [2023-11-19 05:11:12,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:11" (2/3) ... [2023-11-19 05:11:12,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5e1c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:11:12, skipping insertion in model container [2023-11-19 05:11:12,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:11:12" (3/3) ... [2023-11-19 05:11:12,146 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_1.i [2023-11-19 05:11:12,165 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:11:12,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-11-19 05:11:12,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:11:12,228 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@73b7700c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:11:12,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-19 05:11:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 41 states have (on average 2.292682926829268) internal successors, (94), 81 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:11:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:11:12,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:12,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:11:12,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:12,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1992725426, now seen corresponding path program 1 times [2023-11-19 05:11:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428791508] [2023-11-19 05:11:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:12,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:12,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428791508] [2023-11-19 05:11:12,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428791508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:12,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:11:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111904589] [2023-11-19 05:11:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:12,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 05:11:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 05:11:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:11:12,467 INFO L87 Difference]: Start difference. First operand has 83 states, 41 states have (on average 2.292682926829268) internal successors, (94), 81 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-11-19 05:11:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:12,519 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-11-19 05:11:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 05:11:12,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-11-19 05:11:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:12,549 INFO L225 Difference]: With dead ends: 82 [2023-11-19 05:11:12,549 INFO L226 Difference]: Without dead ends: 76 [2023-11-19 05:11:12,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:11:12,555 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:12,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:11:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-19 05:11:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-19 05:11:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 75 states have internal predecessors, (80), 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) [2023-11-19 05:11:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-11-19 05:11:12,602 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 6 [2023-11-19 05:11:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:12,603 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-11-19 05:11:12,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-11-19 05:11:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-11-19 05:11:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:11:12,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:12,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:11:12,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:11:12,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:12,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1992577303, now seen corresponding path program 1 times [2023-11-19 05:11:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655533483] [2023-11-19 05:11:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:12,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655533483] [2023-11-19 05:11:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655533483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:12,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:12,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:11:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874526400] [2023-11-19 05:11:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:12,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:11:12,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:11:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:11:12,851 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-11-19 05:11:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:13,041 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2023-11-19 05:11:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:11:13,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-19 05:11:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:13,043 INFO L225 Difference]: With dead ends: 94 [2023-11-19 05:11:13,044 INFO L226 Difference]: Without dead ends: 94 [2023-11-19 05:11:13,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:11:13,046 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 134 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:13,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 32 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:11:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-19 05:11:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-11-19 05:11:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.8125) internal successors, (87), 74 states have internal predecessors, (87), 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) [2023-11-19 05:11:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-11-19 05:11:13,058 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 6 [2023-11-19 05:11:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:13,059 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-11-19 05:11:13,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-11-19 05:11:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-11-19 05:11:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:11:13,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:13,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:11:13,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:11:13,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:13,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1992577302, now seen corresponding path program 1 times [2023-11-19 05:11:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841200290] [2023-11-19 05:11:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:13,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841200290] [2023-11-19 05:11:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841200290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:11:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933618343] [2023-11-19 05:11:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:13,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:11:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:11:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:11:13,262 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-11-19 05:11:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:13,598 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2023-11-19 05:11:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:11:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-19 05:11:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:13,601 INFO L225 Difference]: With dead ends: 147 [2023-11-19 05:11:13,605 INFO L226 Difference]: Without dead ends: 147 [2023-11-19 05:11:13,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:11:13,609 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 111 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:13,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 78 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:11:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-19 05:11:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2023-11-19 05:11:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 101 states have internal predecessors, (125), 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) [2023-11-19 05:11:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2023-11-19 05:11:13,638 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 6 [2023-11-19 05:11:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:13,639 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2023-11-19 05:11:13,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-11-19 05:11:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2023-11-19 05:11:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:11:13,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:13,641 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:13,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:11:13,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:13,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -718284423, now seen corresponding path program 1 times [2023-11-19 05:11:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:13,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360603181] [2023-11-19 05:11:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:13,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:13,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360603181] [2023-11-19 05:11:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360603181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:13,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:13,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:11:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334953139] [2023-11-19 05:11:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:13,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:11:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:11:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:11:13,912 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-19 05:11:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:14,254 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-11-19 05:11:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:11:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-11-19 05:11:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:14,256 INFO L225 Difference]: With dead ends: 120 [2023-11-19 05:11:14,257 INFO L226 Difference]: Without dead ends: 120 [2023-11-19 05:11:14,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:11:14,259 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 97 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:14,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 102 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:11:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-19 05:11:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2023-11-19 05:11:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 98 states have internal predecessors, (122), 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) [2023-11-19 05:11:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2023-11-19 05:11:14,273 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 12 [2023-11-19 05:11:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:14,273 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2023-11-19 05:11:14,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-19 05:11:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2023-11-19 05:11:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:11:14,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:14,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:14,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:11:14,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:14,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash -718284422, now seen corresponding path program 1 times [2023-11-19 05:11:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:14,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911121122] [2023-11-19 05:11:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:14,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:14,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911121122] [2023-11-19 05:11:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911121122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:14,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:11:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135489943] [2023-11-19 05:11:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:14,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:11:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:14,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:11:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:11:14,659 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-19 05:11:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:14,917 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2023-11-19 05:11:14,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:11:14,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-11-19 05:11:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:14,920 INFO L225 Difference]: With dead ends: 112 [2023-11-19 05:11:14,920 INFO L226 Difference]: Without dead ends: 112 [2023-11-19 05:11:14,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:11:14,922 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 54 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:14,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 146 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:11:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-19 05:11:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2023-11-19 05:11:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 82 states have internal predecessors, (106), 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) [2023-11-19 05:11:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2023-11-19 05:11:14,937 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 12 [2023-11-19 05:11:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:14,937 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2023-11-19 05:11:14,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-19 05:11:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2023-11-19 05:11:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:11:14,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:14,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:14,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:11:14,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:14,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1704337968, now seen corresponding path program 1 times [2023-11-19 05:11:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513307926] [2023-11-19 05:11:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:15,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:15,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513307926] [2023-11-19 05:11:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513307926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:15,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:15,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:11:15,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806795484] [2023-11-19 05:11:15,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:15,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:11:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:15,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:11:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:11:15,254 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) [2023-11-19 05:11:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:15,527 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2023-11-19 05:11:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:11:15,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2023-11-19 05:11:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:15,529 INFO L225 Difference]: With dead ends: 136 [2023-11-19 05:11:15,529 INFO L226 Difference]: Without dead ends: 136 [2023-11-19 05:11:15,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:11:15,530 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 199 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:15,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 93 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:11:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-19 05:11:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 78. [2023-11-19 05:11:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.532258064516129) internal successors, (95), 77 states have internal predecessors, (95), 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) [2023-11-19 05:11:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-11-19 05:11:15,551 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 13 [2023-11-19 05:11:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:15,551 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-11-19 05:11:15,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) [2023-11-19 05:11:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-11-19 05:11:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:11:15,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:15,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:15,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:11:15,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:15,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1490657010, now seen corresponding path program 1 times [2023-11-19 05:11:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:15,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800737901] [2023-11-19 05:11:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:15,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800737901] [2023-11-19 05:11:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800737901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:15,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:11:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537669270] [2023-11-19 05:11:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:15,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:11:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:15,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:11:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:11:15,856 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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) [2023-11-19 05:11:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:16,156 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2023-11-19 05:11:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:11:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 [2023-11-19 05:11:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:16,158 INFO L225 Difference]: With dead ends: 126 [2023-11-19 05:11:16,158 INFO L226 Difference]: Without dead ends: 126 [2023-11-19 05:11:16,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:11:16,159 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 159 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:16,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 106 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:11:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-19 05:11:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 73. [2023-11-19 05:11:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 72 states have internal predecessors, (84), 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) [2023-11-19 05:11:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2023-11-19 05:11:16,166 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 15 [2023-11-19 05:11:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:16,167 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2023-11-19 05:11:16,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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) [2023-11-19 05:11:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2023-11-19 05:11:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:11:16,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:16,168 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:16,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:11:16,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:16,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 263908707, now seen corresponding path program 1 times [2023-11-19 05:11:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:16,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716234531] [2023-11-19 05:11:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:16,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716234531] [2023-11-19 05:11:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716234531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:11:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225839931] [2023-11-19 05:11:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:16,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:11:16,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:11:16,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:11:16,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:11:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:16,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 05:11:16,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:11:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:16,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:11:16,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:16,756 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 [2023-11-19 05:11:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225839931] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:11:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1710663999] [2023-11-19 05:11:16,939 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-19 05:11:16,939 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:11:16,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:11:16,950 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:11:16,950 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:11:19,117 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:11:20,183 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1650#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 3) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~y~0#1_28| Int) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_101| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_84| Int)) (and (= (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| (select (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84|))) |v_#memory_$Pointer$.base_54|) (or (and (= |v_ULTIMATE.start_main_~p~0#1.offset_84| 0) (= |v_ULTIMATE.start_main_~y~0#1_28| 0)) (= |ULTIMATE.start_main_~t~0#1.offset| 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 8) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_101|)) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_101|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) 0))) (= (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| (select (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84|))) |v_#memory_$Pointer$.offset_54|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_84|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) 0))) (= |#memory_int| (store |v_#memory_int_43| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (store (select |v_#memory_int_43| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| 3) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4))))) (<= 0 |v_ULTIMATE.start_main_~y~0#1_28|))) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))' at error location [2023-11-19 05:11:20,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:11:20,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:11:20,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2023-11-19 05:11:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169378834] [2023-11-19 05:11:20,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:11:20,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:11:20,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:20,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:11:20,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2023-11-19 05:11:20,186 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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) [2023-11-19 05:11:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:20,484 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2023-11-19 05:11:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:11:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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 [2023-11-19 05:11:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:20,486 INFO L225 Difference]: With dead ends: 105 [2023-11-19 05:11:20,486 INFO L226 Difference]: Without dead ends: 105 [2023-11-19 05:11:20,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2023-11-19 05:11:20,487 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 379 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:20,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 91 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:11:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-19 05:11:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2023-11-19 05:11:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 states have internal predecessors, (82), 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) [2023-11-19 05:11:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-11-19 05:11:20,503 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2023-11-19 05:11:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:20,503 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-11-19 05:11:20,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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) [2023-11-19 05:11:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-11-19 05:11:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:11:20,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:20,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:20,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:11:20,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:11:20,711 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:20,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1993991201, now seen corresponding path program 1 times [2023-11-19 05:11:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:20,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303891488] [2023-11-19 05:11:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:21,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303891488] [2023-11-19 05:11:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303891488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:21,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:21,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:11:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944522292] [2023-11-19 05:11:21,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:21,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:11:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:11:21,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:11:21,059 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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) [2023-11-19 05:11:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:21,345 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2023-11-19 05:11:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:11:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 [2023-11-19 05:11:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:21,347 INFO L225 Difference]: With dead ends: 115 [2023-11-19 05:11:21,347 INFO L226 Difference]: Without dead ends: 115 [2023-11-19 05:11:21,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:11:21,348 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 194 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:21,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 92 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:11:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-19 05:11:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2023-11-19 05:11:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.4) internal successors, (84), 74 states have internal predecessors, (84), 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) [2023-11-19 05:11:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-19 05:11:21,353 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 17 [2023-11-19 05:11:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:21,353 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-19 05:11:21,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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) [2023-11-19 05:11:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-19 05:11:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:11:21,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:21,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:21,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:11:21,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:21,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 623285666, now seen corresponding path program 1 times [2023-11-19 05:11:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:21,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271597805] [2023-11-19 05:11:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:21,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271597805] [2023-11-19 05:11:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271597805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:21,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:11:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934152552] [2023-11-19 05:11:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:21,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:11:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:11:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:11:21,457 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:11:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:21,557 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-11-19 05:11:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:11:21,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:11:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:21,559 INFO L225 Difference]: With dead ends: 91 [2023-11-19 05:11:21,559 INFO L226 Difference]: Without dead ends: 91 [2023-11-19 05:11:21,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:11:21,560 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 100 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:21,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 51 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:11:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-19 05:11:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2023-11-19 05:11:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 76 states have internal predecessors, (86), 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) [2023-11-19 05:11:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-19 05:11:21,569 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2023-11-19 05:11:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:21,569 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-19 05:11:21,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:11:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-19 05:11:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:11:21,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:21,571 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:21,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:11:21,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:21,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1980779038, now seen corresponding path program 1 times [2023-11-19 05:11:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:21,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692264368] [2023-11-19 05:11:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:22,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692264368] [2023-11-19 05:11:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692264368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:11:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152204909] [2023-11-19 05:11:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:22,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:11:22,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:11:22,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:11:22,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:11:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:22,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-19 05:11:22,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:11:22,238 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 [2023-11-19 05:11:22,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:11:22,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 05:11:22,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:11:22,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-19 05:11:22,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 05:11:22,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-19 05:11:22,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:11:22,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:11:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:22,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:11:22,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:22,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-19 05:11:22,626 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-19 05:11:22,626 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 33 treesize of output 32 [2023-11-19 05:11:22,637 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 20 treesize of output 18 [2023-11-19 05:11:22,656 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-19 05:11:22,656 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 13 treesize of output 12 [2023-11-19 05:11:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152204909] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:11:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1500456926] [2023-11-19 05:11:22,704 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 05:11:22,705 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:11:22,705 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:11:22,705 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:11:22,705 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:11:28,428 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:11:29,651 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2357#(and (or (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_96| Int) (|v_ULTIMATE.start_main_~p~0#1.base_115| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_115|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_96| 4)) |ULTIMATE.start_main_~p~0#1.base|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_96| 8) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_115|)) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_115|) 1) (= |ULTIMATE.start_main_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_115|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_96| 4))) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_96|))) (and (exists ((|v_#memory_$Pointer$.base_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_92| Int) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_111| Int) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_111|) 1) (= (store |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_main_~p~0#1.base_111| (store (select |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_main_~p~0#1.base_111|) |v_ULTIMATE.start_main_~p~0#1.offset_92| (select (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_main_~p~0#1.base_111|) |v_ULTIMATE.start_main_~p~0#1.offset_92|))) |v_#memory_$Pointer$.offset_66|) (= |#memory_int| (store |v_#memory_int_59| |v_ULTIMATE.start_main_~p~0#1.base_111| (store (store (select |v_#memory_int_59| |v_ULTIMATE.start_main_~p~0#1.base_111|) |v_ULTIMATE.start_main_~p~0#1.offset_92| 3) (+ |v_ULTIMATE.start_main_~p~0#1.offset_92| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_111|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_92| 4))))) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_92|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_92| 8) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_111|)) (= (store |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_main_~p~0#1.base_111| (store (select |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_main_~p~0#1.base_111|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_92| 4) 0)) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_main_~p~0#1.base_111| (store (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_main_~p~0#1.base_111|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_92| 4) 0))) (= (store |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_main_~p~0#1.base_111| (store (select |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_main_~p~0#1.base_111|) |v_ULTIMATE.start_main_~p~0#1.offset_92| (select (select |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_main_~p~0#1.base_111|) |v_ULTIMATE.start_main_~p~0#1.offset_92|))) |v_#memory_$Pointer$.base_67|))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (= |ULTIMATE.start_main_~y~0#1| 0) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)))' at error location [2023-11-19 05:11:29,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:11:29,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:11:29,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-19 05:11:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729464751] [2023-11-19 05:11:29,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:11:29,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-19 05:11:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 05:11:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=877, Unknown=8, NotChecked=0, Total=992 [2023-11-19 05:11:29,654 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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) [2023-11-19 05:11:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:31,485 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2023-11-19 05:11:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-19 05:11:31,486 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:11:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:31,489 INFO L225 Difference]: With dead ends: 187 [2023-11-19 05:11:31,489 INFO L226 Difference]: Without dead ends: 187 [2023-11-19 05:11:31,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=436, Invalid=2748, Unknown=8, NotChecked=0, Total=3192 [2023-11-19 05:11:31,492 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 480 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:31,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 310 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 05:11:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-19 05:11:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 105. [2023-11-19 05:11:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 104 states have internal predecessors, (121), 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) [2023-11-19 05:11:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2023-11-19 05:11:31,504 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 19 [2023-11-19 05:11:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:31,506 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2023-11-19 05:11:31,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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) [2023-11-19 05:11:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2023-11-19 05:11:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:11:31,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:31,509 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:31,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:11:31,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:11:31,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:31,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash 335262017, now seen corresponding path program 1 times [2023-11-19 05:11:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807478762] [2023-11-19 05:11:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:32,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807478762] [2023-11-19 05:11:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807478762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:11:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601141139] [2023-11-19 05:11:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:32,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:11:32,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:11:32,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:11:32,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:11:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:32,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-19 05:11:32,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:11:32,522 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:11:32,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 05:11:32,533 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 [2023-11-19 05:11:32,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 05:11:32,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 05:11:32,718 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 05:11:32,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-19 05:11:32,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 05:11:32,741 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-19 05:11:32,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2023-11-19 05:11:32,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-19 05:11:32,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-19 05:11:32,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-19 05:11:32,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-19 05:11:32,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-19 05:11:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:32,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:11:32,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_277 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-11-19 05:11:32,983 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_277 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2023-11-19 05:11:32,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:32,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-19 05:11:33,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:33,005 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 40 treesize of output 39 [2023-11-19 05:11:33,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 05:11:33,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:33,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-19 05:11:33,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:33,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-19 05:11:33,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:11:33,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:11:33,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-19 05:11:33,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:11:33,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:11:33,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-19 05:11:33,125 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-19 05:11:33,125 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 13 treesize of output 12 [2023-11-19 05:11:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 05:11:33,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601141139] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:11:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791530608] [2023-11-19 05:11:33,160 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 05:11:33,160 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:11:33,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:11:33,160 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:11:33,161 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:11:35,507 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:11:37,881 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2838#(and (= |ULTIMATE.start_main_~y~0#1| 0) (or (and (exists ((|v_ULTIMATE.start_main_#t~short10#1_16| Bool) (|v_ULTIMATE.start_main_~y~0#1_37| Int) (|v_ULTIMATE.start_main_#t~nondet9#1_43| Int) (|v_ULTIMATE.start_main_#t~nondet9#1_42| Int)) (and (or (and (= |v_ULTIMATE.start_main_#t~nondet9#1_43| |v_ULTIMATE.start_main_#t~nondet9#1_42|) (not |v_ULTIMATE.start_main_#t~short10#1_16|)) (and |v_ULTIMATE.start_main_#t~short10#1_16| (= |v_ULTIMATE.start_main_#t~nondet9#1_43| 0))) (or (and (not |v_ULTIMATE.start_main_#t~short10#1_16|) (<= 10 |v_ULTIMATE.start_main_~y~0#1_37|)) (and (<= |v_ULTIMATE.start_main_~y~0#1_37| 9) |v_ULTIMATE.start_main_#t~short10#1_16|)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (exists ((|v_#memory_int_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_106| Int) (|v_ULTIMATE.start_main_~p~0#1.base_127| Int) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_main_~p~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_main_~p~0#1.base_127|) |v_ULTIMATE.start_main_~p~0#1.offset_106| (select (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_main_~p~0#1.base_127|) |v_ULTIMATE.start_main_~p~0#1.offset_106|))) |v_#memory_$Pointer$.offset_83|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_127|) 1) (= |#memory_int| (store |v_#memory_int_73| |v_ULTIMATE.start_main_~p~0#1.base_127| (store (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~p~0#1.base_127|) |v_ULTIMATE.start_main_~p~0#1.offset_106| 3) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_106|) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_127|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_106|))))) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_106|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_127|)) (= (store |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_main_~p~0#1.base_127| (store (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_main_~p~0#1.base_127|) |v_ULTIMATE.start_main_~p~0#1.offset_106| (select (select |v_#memory_$Pointer$.base_84| |v_ULTIMATE.start_main_~p~0#1.base_127|) |v_ULTIMATE.start_main_~p~0#1.offset_106|))) |v_#memory_$Pointer$.base_84|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_main_~p~0#1.base_127| (store (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_main_~p~0#1.base_127|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_106|) 0))) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_106|) (= (store |v_#memory_$Pointer$.base_84| |v_ULTIMATE.start_main_~p~0#1.base_127| (store (select |v_#memory_$Pointer$.base_84| |v_ULTIMATE.start_main_~p~0#1.base_127|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_106|) 0)) |#memory_$Pointer$.base|)))) (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_110| Int) (|v_ULTIMATE.start_main_~p~0#1.base_131| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_131|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) |ULTIMATE.start_main_~p~0#1.base|) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_131|) 1) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_110|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_131|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) |ULTIMATE.start_main_~p~0#1.offset|) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_110|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_131|))))) (or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))))' at error location [2023-11-19 05:11:37,882 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:11:37,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:11:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2023-11-19 05:11:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479818927] [2023-11-19 05:11:37,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:11:37,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 05:11:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:37,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 05:11:37,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=776, Unknown=2, NotChecked=114, Total=992 [2023-11-19 05:11:37,885 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 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) [2023-11-19 05:11:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:39,554 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2023-11-19 05:11:39,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:11:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:11:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:39,557 INFO L225 Difference]: With dead ends: 199 [2023-11-19 05:11:39,557 INFO L226 Difference]: Without dead ends: 199 [2023-11-19 05:11:39,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=276, Invalid=1622, Unknown=2, NotChecked=170, Total=2070 [2023-11-19 05:11:39,559 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 520 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 405 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:39,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 323 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 753 Invalid, 0 Unknown, 405 Unchecked, 0.8s Time] [2023-11-19 05:11:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-19 05:11:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 117. [2023-11-19 05:11:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 116 states have internal predecessors, (137), 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) [2023-11-19 05:11:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2023-11-19 05:11:39,568 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 19 [2023-11-19 05:11:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:39,568 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2023-11-19 05:11:39,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 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) [2023-11-19 05:11:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2023-11-19 05:11:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:11:39,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:39,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:39,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:11:39,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:11:39,775 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:39,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2141986674, now seen corresponding path program 1 times [2023-11-19 05:11:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551822219] [2023-11-19 05:11:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:39,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:39,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551822219] [2023-11-19 05:11:39,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551822219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:39,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:39,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:11:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801340172] [2023-11-19 05:11:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:39,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:11:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:39,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:11:39,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:11:39,837 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2023-11-19 05:11:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:39,943 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2023-11-19 05:11:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:11:39,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2023-11-19 05:11:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:39,945 INFO L225 Difference]: With dead ends: 134 [2023-11-19 05:11:39,945 INFO L226 Difference]: Without dead ends: 134 [2023-11-19 05:11:39,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:11:39,946 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 99 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:39,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 48 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:11:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-19 05:11:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2023-11-19 05:11:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 122 states have internal predecessors, (143), 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) [2023-11-19 05:11:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2023-11-19 05:11:39,951 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 20 [2023-11-19 05:11:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:39,951 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2023-11-19 05:11:39,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2023-11-19 05:11:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2023-11-19 05:11:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:11:39,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:39,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:39,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:11:39,952 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:39,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1159865781, now seen corresponding path program 1 times [2023-11-19 05:11:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303103679] [2023-11-19 05:11:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:40,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303103679] [2023-11-19 05:11:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303103679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:11:40,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019871206] [2023-11-19 05:11:40,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:40,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:11:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:40,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:11:40,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:11:40,052 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2023-11-19 05:11:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:40,218 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2023-11-19 05:11:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:11:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2023-11-19 05:11:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:40,220 INFO L225 Difference]: With dead ends: 150 [2023-11-19 05:11:40,220 INFO L226 Difference]: Without dead ends: 146 [2023-11-19 05:11:40,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:11:40,221 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 58 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:40,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 113 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:11:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-19 05:11:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2023-11-19 05:11:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 125 states have internal predecessors, (146), 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) [2023-11-19 05:11:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2023-11-19 05:11:40,226 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 22 [2023-11-19 05:11:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:40,226 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2023-11-19 05:11:40,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2023-11-19 05:11:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2023-11-19 05:11:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:11:40,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:40,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:40,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 05:11:40,228 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-19 05:11:40,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1991834948, now seen corresponding path program 1 times [2023-11-19 05:11:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:40,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835490190] [2023-11-19 05:11:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:41,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835490190] [2023-11-19 05:11:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835490190] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:11:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274124845] [2023-11-19 05:11:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:11:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:11:41,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:11:41,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ebe4d9-a1f1-4c03-aa38-fff8a5ff547f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:11:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:41,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 05:11:41,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:11:41,289 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 [2023-11-19 05:11:41,293 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 [2023-11-19 05:11:41,440 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 05:11:41,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-19 05:11:41,448 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 5 treesize of output 3 [2023-11-19 05:11:41,468 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 05:11:41,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-19 05:11:41,480 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 [2023-11-19 05:11:41,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 05:11:41,560 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 05:11:41,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-11-19 05:11:41,578 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 05:11:41,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-11-19 05:11:41,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-19 05:11:41,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 05:11:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:11:41,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:11:42,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:42,096 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 112 treesize of output 139 [2023-11-19 05:11:42,129 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 6 treesize of output 4 [2023-11-19 05:11:42,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:11:42,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 634 treesize of output 798