./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:19:55,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:19:55,964 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 07:19:55,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:19:55,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:19:56,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:19:56,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:19:56,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:19:56,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:19:56,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:19:56,041 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:19:56,042 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:19:56,042 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:19:56,044 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:19:56,047 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:19:56,047 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:19:56,048 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:19:56,048 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:19:56,048 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:19:56,049 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:19:56,049 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:19:56,070 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:19:56,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:19:56,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:19:56,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:19:56,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:19:56,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:19:56,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:19:56,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:19:56,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:19:56,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:19:56,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:19:56,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:19:56,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:19:56,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:19:56,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:19:56,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:19:56,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:19:56,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:19:56,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:19:56,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:19:56,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:19:56,078 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:19:56,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:19:56,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:19:56,080 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:19:56,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:19:56,080 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_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a [2024-11-09 07:19:56,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:19:56,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:19:56,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:19:56,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:19:56,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:19:56,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i Unable to find full path for "g++" [2024-11-09 07:19:58,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:19:59,286 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:19:59,287 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-09 07:19:59,312 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/data/1d9e54c90/f4ef84b060f84e8b9c3bebdfb1503162/FLAG4a16388a5 [2024-11-09 07:19:59,477 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/data/1d9e54c90/f4ef84b060f84e8b9c3bebdfb1503162 [2024-11-09 07:19:59,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:19:59,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:19:59,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:19:59,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:19:59,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:19:59,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:59" (1/1) ... [2024-11-09 07:19:59,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73557d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:59, skipping insertion in model container [2024-11-09 07:19:59,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:59" (1/1) ... [2024-11-09 07:19:59,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:19:59,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-11-09 07:19:59,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:19:59,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:20:00,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-11-09 07:20:00,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:20:00,092 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:20:00,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00 WrapperNode [2024-11-09 07:20:00,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:20:00,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:20:00,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:20:00,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:20:00,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,153 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 196 [2024-11-09 07:20:00,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:20:00,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:20:00,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:20:00,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:20:00,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:20:00,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:20:00,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:20:00,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:20:00,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (1/1) ... [2024-11-09 07:20:00,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:20:00,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:20:00,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:20:00,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 07:20:00,308 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 07:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 07:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 07:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:20:00,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:20:00,461 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:20:00,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:20:00,525 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 07:20:01,021 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-09 07:20:01,021 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:20:01,247 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:20:01,248 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-09 07:20:01,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:20:01 BoogieIcfgContainer [2024-11-09 07:20:01,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:20:01,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:20:01,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:20:01,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:20:01,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:19:59" (1/3) ... [2024-11-09 07:20:01,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e311d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:01, skipping insertion in model container [2024-11-09 07:20:01,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:00" (2/3) ... [2024-11-09 07:20:01,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e311d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:01, skipping insertion in model container [2024-11-09 07:20:01,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:20:01" (3/3) ... [2024-11-09 07:20:01,264 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2024-11-09 07:20:01,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:20:01,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:20:01,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:20:01,379 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3352fb22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:20:01,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:20:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 37 states have internal predecessors, (55), 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) [2024-11-09 07:20:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:20:01,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:01,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:01,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:20:01,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash 128337693, now seen corresponding path program 1 times [2024-11-09 07:20:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:20:01,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150021718] [2024-11-09 07:20:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:20:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:20:01,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:20:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150021718] [2024-11-09 07:20:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150021718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:20:01,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:20:01,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:20:01,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805182053] [2024-11-09 07:20:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:20:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:20:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:20:01,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:20:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:20:01,807 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 37 states have internal predecessors, (55), 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 7.5) internal successors, (15), 2 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) [2024-11-09 07:20:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:02,060 INFO L93 Difference]: Finished difference Result 77 states and 115 transitions. [2024-11-09 07:20:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:20:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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 [2024-11-09 07:20:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:02,074 INFO L225 Difference]: With dead ends: 77 [2024-11-09 07:20:02,074 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 07:20:02,078 INFO L431 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 [2024-11-09 07:20:02,084 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:02,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:20:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 07:20:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 07:20:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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) [2024-11-09 07:20:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-09 07:20:02,133 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2024-11-09 07:20:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:02,134 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-09 07:20:02,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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) [2024-11-09 07:20:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-09 07:20:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:20:02,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:02,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:02,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:20:02,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:20:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2020368148, now seen corresponding path program 1 times [2024-11-09 07:20:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:20:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818466681] [2024-11-09 07:20:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:20:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:20:02,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:20:02,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818466681] [2024-11-09 07:20:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818466681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:20:02,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:20:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:20:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878135044] [2024-11-09 07:20:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:20:02,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:20:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:20:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:20:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:20:02,311 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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) [2024-11-09 07:20:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:02,562 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2024-11-09 07:20:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:20:02,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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 [2024-11-09 07:20:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:02,566 INFO L225 Difference]: With dead ends: 57 [2024-11-09 07:20:02,568 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 07:20:02,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:20:02,570 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:02,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:20:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 07:20:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-09 07:20:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-09 07:20:02,581 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2024-11-09 07:20:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-09 07:20:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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) [2024-11-09 07:20:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-09 07:20:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:20:02,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:02,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:02,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:20:02,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:20:02,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:02,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2681149, now seen corresponding path program 1 times [2024-11-09 07:20:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:20:02,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107453256] [2024-11-09 07:20:02,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:20:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:03,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:20:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107453256] [2024-11-09 07:20:03,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107453256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:20:03,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:20:03,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:20:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274391205] [2024-11-09 07:20:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:20:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:20:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:20:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:20:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:20:03,032 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:03,422 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-09 07:20:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:20:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2024-11-09 07:20:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:03,425 INFO L225 Difference]: With dead ends: 51 [2024-11-09 07:20:03,425 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 07:20:03,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:20:03,427 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:03,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:20:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 07:20:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-11-09 07:20:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2024-11-09 07:20:03,437 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 25 [2024-11-09 07:20:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:03,438 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-11-09 07:20:03,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-11-09 07:20:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:20:03,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:03,440 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:03,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:20:03,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:20:03,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash -587068450, now seen corresponding path program 1 times [2024-11-09 07:20:03,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:20:03,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289803694] [2024-11-09 07:20:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:20:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:03,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:20:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289803694] [2024-11-09 07:20:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289803694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:20:03,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:20:03,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:20:03,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103819713] [2024-11-09 07:20:03,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:20:03,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:20:03,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:20:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:20:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:20:03,930 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:04,384 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-11-09 07:20:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:20:04,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 07:20:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:04,386 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:20:04,386 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 07:20:04,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:20:04,389 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:04,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:20:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 07:20:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-11-09 07:20:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-11-09 07:20:04,398 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2024-11-09 07:20:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:04,399 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-09 07:20:04,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-11-09 07:20:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:20:04,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:04,400 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:04,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:20:04,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:20:04,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1767063038, now seen corresponding path program 1 times [2024-11-09 07:20:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:20:04,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128491675] [2024-11-09 07:20:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:20:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:04,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:20:04,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128491675] [2024-11-09 07:20:04,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128491675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:20:04,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:20:04,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:20:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948221672] [2024-11-09 07:20:04,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:20:04,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:20:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:20:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:20:04,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:20:04,639 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:05,012 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-09 07:20:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:20:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 07:20:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:05,014 INFO L225 Difference]: With dead ends: 53 [2024-11-09 07:20:05,014 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 07:20:05,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:20:05,016 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:05,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 91 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:20:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 07:20:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-09 07:20:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 07:20:05,030 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 27 [2024-11-09 07:20:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:05,034 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 07:20:05,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-09 07:20:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:20:05,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:05,035 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:20:05,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:20:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1070259690, now seen corresponding path program 1 times [2024-11-09 07:20:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:20:05,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172573619] [2024-11-09 07:20:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:20:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:05,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:20:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172573619] [2024-11-09 07:20:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172573619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:20:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764168086] [2024-11-09 07:20:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:05,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:20:05,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:20:05,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:20:05,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:20:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:05,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:20:05,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:20:05,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:20:06,096 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:20:06,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:20:06,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:20:06,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:20:06,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:20:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:06,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:20:06,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_239) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= v_ArrVal_238 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_238 .cse0))))))) is different from false [2024-11-09 07:20:06,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:20:06,484 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 132 treesize of output 134 [2024-11-09 07:20:06,510 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 24 treesize of output 20 [2024-11-09 07:20:06,582 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 117 treesize of output 111 [2024-11-09 07:20:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:06,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764168086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:20:06,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1796858609] [2024-11-09 07:20:06,800 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:20:06,800 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:20:06,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:20:06,811 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:20:06,812 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:20:08,799 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:20:40,837 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '869#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_33| Int) (|v_#memory_$Pointer$.base_94| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_31| Int) (|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_93| |v_ULTIMATE.start_main_~p~0#1.base_33| (store (select |v_#memory_$Pointer$.offset_93| |v_ULTIMATE.start_main_~p~0#1.base_33|) |v_ULTIMATE.start_main_~p~0#1.offset_31| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_33|) |v_ULTIMATE.start_main_~p~0#1.offset_31|)))) (= (store |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_main_~p~0#1.base_33| (store (select |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_main_~p~0#1.base_33|) |v_ULTIMATE.start_main_~p~0#1.offset_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_33|) |v_ULTIMATE.start_main_~p~0#1.offset_31|))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_120| |v_ULTIMATE.start_main_~p~0#1.base_33| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~p~0#1.base_33|) |v_ULTIMATE.start_main_~p~0#1.offset_31| 3))))) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_34| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_34|) 0) 2)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_34|) 0) 3)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_34|) 0) 1)))))' at error location [2024-11-09 07:20:40,837 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:20:40,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:20:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-09 07:20:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050813281] [2024-11-09 07:20:40,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:20:40,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:20:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:20:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:20:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=754, Unknown=21, NotChecked=56, Total=930 [2024-11-09 07:20:40,841 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:42,134 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-09 07:20:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:20:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:20:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:42,136 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:20:42,136 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 07:20:42,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=132, Invalid=1040, Unknown=22, NotChecked=66, Total=1260 [2024-11-09 07:20:42,138 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:42,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 168 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 138 Invalid, 0 Unknown, 41 Unchecked, 1.1s Time] [2024-11-09 07:20:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 07:20:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-09 07:20:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-11-09 07:20:42,145 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 29 [2024-11-09 07:20:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:42,146 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-09 07:20:42,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:20:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-09 07:20:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:20:42,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:42,147 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:42,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:20:42,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 07:20:42,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:20:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -533168918, now seen corresponding path program 1 times [2024-11-09 07:20:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:20:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563673172] [2024-11-09 07:20:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:20:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:42,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:20:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563673172] [2024-11-09 07:20:42,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563673172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:20:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866238036] [2024-11-09 07:20:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:42,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:20:42,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:20:42,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:20:42,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:20:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:42,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:20:42,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:20:42,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:20:42,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:20:43,009 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:20:43,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:20:43,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:20:43,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:20:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:43,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:20:43,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_340 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_337 .cse0))) v_ArrVal_337)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_337) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-09 07:20:43,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:20:43,210 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 132 treesize of output 134 [2024-11-09 07:20:43,247 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 24 treesize of output 20 [2024-11-09 07:20:43,287 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 63 treesize of output 59 [2024-11-09 07:20:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:20:43,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866238036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:20:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108096648] [2024-11-09 07:20:43,415 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:20:43,415 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:20:43,415 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:20:43,416 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:20:43,416 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:20:46,160 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:21:13,522 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1205#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_39| Int) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_#memory_int_139| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_109| |v_ULTIMATE.start_main_~p~0#1.base_43| (store (select |v_#memory_$Pointer$.base_109| |v_ULTIMATE.start_main_~p~0#1.base_43|) |v_ULTIMATE.start_main_~p~0#1.offset_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_43|) |v_ULTIMATE.start_main_~p~0#1.offset_39|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~p~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~p~0#1.base_43|) |v_ULTIMATE.start_main_~p~0#1.offset_39| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_43|) |v_ULTIMATE.start_main_~p~0#1.offset_39|)))) (= |#memory_int| (store |v_#memory_int_139| |v_ULTIMATE.start_main_~p~0#1.base_43| (store (select |v_#memory_int_139| |v_ULTIMATE.start_main_~p~0#1.base_43|) |v_ULTIMATE.start_main_~p~0#1.offset_39| 3))))) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_44| Int)) (and (not (= 2 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_44|) 0))) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_44|) 0) 1)) (not (= 3 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_44|) 0))))))' at error location [2024-11-09 07:21:13,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:21:13,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:21:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-09 07:21:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591493063] [2024-11-09 07:21:13,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:21:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:21:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:21:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=711, Unknown=20, NotChecked=54, Total=870 [2024-11-09 07:21:13,525 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:21:14,536 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-09 07:21:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:21:14,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:21:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:21:14,539 INFO L225 Difference]: With dead ends: 64 [2024-11-09 07:21:14,539 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:21:14,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=118, Invalid=988, Unknown=20, NotChecked=64, Total=1190 [2024-11-09 07:21:14,541 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:21:14,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 208 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 194 Invalid, 0 Unknown, 49 Unchecked, 0.8s Time] [2024-11-09 07:21:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:21:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-09 07:21:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-11-09 07:21:14,550 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 29 [2024-11-09 07:21:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:21:14,551 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-11-09 07:21:14,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-11-09 07:21:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:21:14,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:21:14,552 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:21:14,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:21:14,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 07:21:14,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:21:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:21:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash -283073211, now seen corresponding path program 1 times [2024-11-09 07:21:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:21:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63993353] [2024-11-09 07:21:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:21:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:15,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:21:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63993353] [2024-11-09 07:21:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63993353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:21:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642842598] [2024-11-09 07:21:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:21:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:21:15,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:21:15,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:21:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:15,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:21:15,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:21:15,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:21:16,034 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:21:16,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:21:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:21:16,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:21:16,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:21:16,170 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 80 treesize of output 73 [2024-11-09 07:21:16,178 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 29 treesize of output 19 [2024-11-09 07:21:16,184 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 40 treesize of output 23 [2024-11-09 07:21:16,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-09 07:21:16,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:21:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:21:16,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:21:16,300 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 79 treesize of output 57 [2024-11-09 07:21:16,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_440 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2024-11-09 07:21:16,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:16,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:21:16,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:16,355 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 36 treesize of output 35 [2024-11-09 07:21:16,359 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 [2024-11-09 07:21:16,387 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:21:16,387 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 1 [2024-11-09 07:21:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:21:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642842598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:21:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [552669224] [2024-11-09 07:21:16,563 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:21:16,563 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:21:16,564 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:21:16,564 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:21:16,564 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:21:17,826 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:21:43,502 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1585#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_56| Int)) (and (not (= 1 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_60|) |v_ULTIMATE.start_main_~p~0#1.offset_56|))) (not (= 3 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_60|) |v_ULTIMATE.start_main_~p~0#1.offset_56|))))))' at error location [2024-11-09 07:21:43,502 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:21:43,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:21:43,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2024-11-09 07:21:43,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094371825] [2024-11-09 07:21:43,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:21:43,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:21:43,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:43,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:21:43,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1036, Unknown=11, NotChecked=66, Total=1260 [2024-11-09 07:21:43,505 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:21:44,690 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2024-11-09 07:21:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:21:44,691 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 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 31 [2024-11-09 07:21:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:21:44,692 INFO L225 Difference]: With dead ends: 68 [2024-11-09 07:21:44,692 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 07:21:44,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=164, Invalid=1161, Unknown=11, NotChecked=70, Total=1406 [2024-11-09 07:21:44,694 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:21:44,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 200 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 365 Invalid, 0 Unknown, 65 Unchecked, 1.1s Time] [2024-11-09 07:21:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 07:21:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-09 07:21:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2024-11-09 07:21:44,703 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 31 [2024-11-09 07:21:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:21:44,703 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2024-11-09 07:21:44,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2024-11-09 07:21:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:21:44,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:21:44,705 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:21:44,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:21:44,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 07:21:44,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:21:44,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:21:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash 539099616, now seen corresponding path program 2 times [2024-11-09 07:21:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:21:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199574304] [2024-11-09 07:21:44,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:21:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:45,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:21:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199574304] [2024-11-09 07:21:45,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199574304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:21:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247886570] [2024-11-09 07:21:45,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:21:45,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:21:45,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:21:45,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:21:45,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:21:46,333 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:21:46,333 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:21:46,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:21:46,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:21:46,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:21:46,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:21:46,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:21:46,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:21:46,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:21:46,530 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:21:46,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2024-11-09 07:21:46,539 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 23 treesize of output 15 [2024-11-09 07:21:46,543 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 32 treesize of output 19 [2024-11-09 07:21:46,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 07:21:46,584 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 19 treesize of output 11 [2024-11-09 07:21:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:21:46,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:21:46,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2024-11-09 07:21:46,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_544 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_544) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_541 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2024-11-09 07:21:46,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:46,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:21:46,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:46,704 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 36 treesize of output 35 [2024-11-09 07:21:46,710 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 [2024-11-09 07:21:46,730 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:21:46,731 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 1 [2024-11-09 07:21:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:21:46,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247886570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:21:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1325564444] [2024-11-09 07:21:46,890 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:21:46,890 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:21:46,890 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:21:46,891 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:21:46,891 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:21:51,620 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:22:01,077 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1984#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_73| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_77|) |v_ULTIMATE.start_main_~p~0#1.offset_73|) 1)) (not (= 3 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_77|) |v_ULTIMATE.start_main_~p~0#1.offset_73|))))))' at error location [2024-11-09 07:22:01,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:22:01,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:22:01,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2024-11-09 07:22:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172073332] [2024-11-09 07:22:01,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:22:01,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:22:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:22:01,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:22:01,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1116, Unknown=5, NotChecked=68, Total=1332 [2024-11-09 07:22:01,080 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:22:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:22:02,724 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-11-09 07:22:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:22:02,725 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:22:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:22:02,726 INFO L225 Difference]: With dead ends: 72 [2024-11-09 07:22:02,726 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 07:22:02,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=186, Invalid=1535, Unknown=5, NotChecked=80, Total=1806 [2024-11-09 07:22:02,727 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:22:02,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 211 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 365 Invalid, 0 Unknown, 62 Unchecked, 1.5s Time] [2024-11-09 07:22:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 07:22:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-09 07:22:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:22:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2024-11-09 07:22:02,736 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 33 [2024-11-09 07:22:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:22:02,736 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2024-11-09 07:22:02,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:22:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2024-11-09 07:22:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:22:02,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:22:02,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:22:02,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:22:02,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 07:22:02,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:22:02,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:22:02,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1401736192, now seen corresponding path program 1 times [2024-11-09 07:22:02,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:22:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341578844] [2024-11-09 07:22:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:22:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:22:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:22:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:22:03,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:22:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341578844] [2024-11-09 07:22:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341578844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:22:03,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088323234] [2024-11-09 07:22:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:22:03,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:22:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:22:03,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:22:03,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:22:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:22:03,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:22:03,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:22:03,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:22:03,906 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:22:03,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:22:03,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:22:03,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:22:04,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:22:04,013 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 80 treesize of output 73 [2024-11-09 07:22:04,024 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 29 treesize of output 19 [2024-11-09 07:22:04,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-09 07:22:04,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-09 07:22:04,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:22:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:22:04,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:22:04,181 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 52 treesize of output 30 [2024-11-09 07:22:04,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:22:04,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:22:04,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:22:04,309 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 38 treesize of output 31 [2024-11-09 07:22:04,315 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 11 treesize of output 7 [2024-11-09 07:22:04,334 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:22:04,334 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 22 treesize of output 1 [2024-11-09 07:22:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:22:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088323234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:22:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1012364232] [2024-11-09 07:22:04,487 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:22:04,487 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:22:04,487 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:22:04,487 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:22:04,488 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:22:05,582 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:22:28,148 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2400#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_91| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_95|) |v_ULTIMATE.start_main_~p~0#1.offset_91|) 1)) (not (= 3 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_95|) |v_ULTIMATE.start_main_~p~0#1.offset_91|))))))' at error location [2024-11-09 07:22:28,148 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:22:28,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:22:28,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2024-11-09 07:22:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255414145] [2024-11-09 07:22:28,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:22:28,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:22:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:22:28,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:22:28,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1234, Unknown=14, NotChecked=0, Total=1406 [2024-11-09 07:22:28,150 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:22:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:22:29,504 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2024-11-09 07:22:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:22:29,505 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:22:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:22:29,505 INFO L225 Difference]: With dead ends: 70 [2024-11-09 07:22:29,505 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 07:22:29,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=212, Invalid=1666, Unknown=14, NotChecked=0, Total=1892 [2024-11-09 07:22:29,507 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:22:29,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 237 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:22:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 07:22:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-09 07:22:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:22:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-09 07:22:29,513 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 33 [2024-11-09 07:22:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:22:29,514 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-09 07:22:29,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:22:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-09 07:22:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:22:29,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:22:29,515 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:22:29,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:22:29,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:22:29,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:22:29,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:22:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1151908241, now seen corresponding path program 2 times [2024-11-09 07:22:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:22:29,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853928174] [2024-11-09 07:22:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:22:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:22:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:22:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:22:30,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:22:30,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853928174] [2024-11-09 07:22:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853928174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:22:30,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848776451] [2024-11-09 07:22:30,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:22:30,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:22:30,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:22:30,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:22:30,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:22:30,857 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:22:30,857 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:22:30,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 07:22:30,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:22:30,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:22:30,966 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:22:30,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:22:30,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:22:31,066 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 [2024-11-09 07:22:31,150 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:22:31,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:22:31,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:22:31,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:22:31,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:22:31,238 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 16 treesize of output 8 [2024-11-09 07:22:31,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:22:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:22:31,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:22:31,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-09 07:22:31,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_50| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (not (= v_ArrVal_774 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_774 .cse0))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_779) |v_ULTIMATE.start_main_~t~0#1.base_50| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_50|) 0)))) is different from false [2024-11-09 07:22:31,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:22:31,570 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 496 treesize of output 494 [2024-11-09 07:22:31,584 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 55 treesize of output 51 [2024-11-09 07:22:31,604 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 54 treesize of output 46 [2024-11-09 07:22:31,711 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 [2024-11-09 07:22:31,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 48 treesize of output 46 [2024-11-09 07:22:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-09 07:22:34,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848776451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:22:34,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1784222705] [2024-11-09 07:22:34,093 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:22:34,093 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:22:34,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:22:34,094 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:22:34,094 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:22:34,900 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:23:07,029 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2796#(and (exists ((|v_ULTIMATE.start_main_~p~0#1.base_108| Int) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int) (|v_#memory_$Pointer$.offset_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_175| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_213| |v_ULTIMATE.start_main_~p~0#1.base_108| (store (select |v_#memory_int_213| |v_ULTIMATE.start_main_~p~0#1.base_108|) |v_ULTIMATE.start_main_~p~0#1.offset_102| 3))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_main_~p~0#1.base_108| (store (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_main_~p~0#1.base_108|) |v_ULTIMATE.start_main_~p~0#1.offset_102| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_108|) |v_ULTIMATE.start_main_~p~0#1.offset_102|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~p~0#1.base_108| (store (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~p~0#1.base_108|) |v_ULTIMATE.start_main_~p~0#1.offset_102| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_108|) |v_ULTIMATE.start_main_~p~0#1.offset_102|)))))) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_109| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_109|) 0) 3)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_109|) 0) 2)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_109|) 0) 1)))))' at error location [2024-11-09 07:23:07,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:23:07,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:23:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2024-11-09 07:23:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643736636] [2024-11-09 07:23:07,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:23:07,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:23:07,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:23:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:23:07,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1538, Unknown=31, NotChecked=162, Total=1892 [2024-11-09 07:23:07,032 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:23:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:23:08,239 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-11-09 07:23:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:23:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:23:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:23:08,240 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:23:08,240 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:23:08,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=183, Invalid=1686, Unknown=31, NotChecked=170, Total=2070 [2024-11-09 07:23:08,242 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:23:08,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 290 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 267 Invalid, 0 Unknown, 82 Unchecked, 1.1s Time] [2024-11-09 07:23:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:23:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 07:23:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:23:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-11-09 07:23:08,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2024-11-09 07:23:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:23:08,250 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-09 07:23:08,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:23:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-11-09 07:23:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:23:08,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:23:08,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:23:08,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:23:08,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:23:08,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:23:08,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:23:08,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1490102127, now seen corresponding path program 1 times [2024-11-09 07:23:08,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:23:08,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806612779] [2024-11-09 07:23:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:23:08,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:23:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:23:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:23:08,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:23:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806612779] [2024-11-09 07:23:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806612779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:23:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419470723] [2024-11-09 07:23:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:23:08,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:23:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:23:08,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:23:08,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:23:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:23:09,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 07:23:09,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:23:09,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:23:09,275 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:23:09,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:23:09,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:23:09,346 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 [2024-11-09 07:23:09,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:23:09,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:23:09,525 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 07:23:09,525 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 19 treesize of output 22 [2024-11-09 07:23:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:23:09,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:23:10,003 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_115| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_911))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_115| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_115|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-09 07:23:10,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_115| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_911))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_115| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_115|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-09 07:23:10,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_115| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_911))) (or (not (= v_ArrVal_906 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_906 .cse0))))) (= 3 (select (select (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_115| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_115|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-09 07:23:10,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:10,164 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 2771 treesize of output 2719 [2024-11-09 07:23:10,209 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 615 treesize of output 579 [2024-11-09 07:23:11,073 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 21 treesize of output 17 [2024-11-09 07:23:11,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 119 [2024-11-09 07:23:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 07:23:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419470723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:23:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111535767] [2024-11-09 07:23:11,254 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 07:23:11,254 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:23:11,254 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:23:11,255 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:23:11,255 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:23:16,119 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:23:43,752 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3191#(and (exists ((|v_ULTIMATE.start_main_~p~0#1.base_123| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_123|) 0) 1)) (not (= 3 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_123|) 0))) (not (= 2 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_123|) 0))))) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_239| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_192| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_122| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_115| Int)) (and (= (store |v_#memory_int_239| |v_ULTIMATE.start_main_~p~0#1.base_122| (store (select |v_#memory_int_239| |v_ULTIMATE.start_main_~p~0#1.base_122|) |v_ULTIMATE.start_main_~p~0#1.offset_115| 3)) |#memory_int|) (= (store |v_#memory_$Pointer$.base_195| |v_ULTIMATE.start_main_~p~0#1.base_122| (store (select |v_#memory_$Pointer$.base_195| |v_ULTIMATE.start_main_~p~0#1.base_122|) |v_ULTIMATE.start_main_~p~0#1.offset_115| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_122|) |v_ULTIMATE.start_main_~p~0#1.offset_115|))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_main_~p~0#1.base_122| (store (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_main_~p~0#1.base_122|) |v_ULTIMATE.start_main_~p~0#1.offset_115| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_122|) |v_ULTIMATE.start_main_~p~0#1.offset_115|)))))))' at error location [2024-11-09 07:23:43,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:23:43,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:23:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2024-11-09 07:23:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487006135] [2024-11-09 07:23:43,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:23:43,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:23:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:23:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:23:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1807, Unknown=20, NotChecked=264, Total=2256 [2024-11-09 07:23:43,755 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:23:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:23:45,751 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-11-09 07:23:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:23:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:23:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:23:45,753 INFO L225 Difference]: With dead ends: 67 [2024-11-09 07:23:45,753 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 07:23:45,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=274, Invalid=2580, Unknown=20, NotChecked=318, Total=3192 [2024-11-09 07:23:45,755 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:23:45,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 337 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 337 Invalid, 0 Unknown, 157 Unchecked, 1.6s Time] [2024-11-09 07:23:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 07:23:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-11-09 07:23:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:23:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-11-09 07:23:45,768 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 33 [2024-11-09 07:23:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:23:45,768 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-09 07:23:45,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:23:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-11-09 07:23:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:23:45,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:23:45,769 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:23:45,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:23:45,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:23:45,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:23:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:23:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash 871772972, now seen corresponding path program 3 times [2024-11-09 07:23:45,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:23:45,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618459712] [2024-11-09 07:23:45,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:23:45,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:23:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:23:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:23:47,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:23:47,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618459712] [2024-11-09 07:23:47,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618459712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:23:47,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129770026] [2024-11-09 07:23:47,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:23:47,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:23:47,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:23:47,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:23:47,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:23:47,226 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:23:47,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:23:47,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 07:23:47,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:23:47,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:23:47,316 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:23:47,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:23:47,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:23:47,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:23:47,442 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:23:47,442 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 [2024-11-09 07:23:47,463 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-09 07:23:47,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-09 07:23:47,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:23:47,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:23:47,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:23:47,570 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-09 07:23:47,570 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 219 treesize of output 143 [2024-11-09 07:23:47,580 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 160 treesize of output 133 [2024-11-09 07:23:47,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2024-11-09 07:23:47,678 INFO L349 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2024-11-09 07:23:47,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 161 [2024-11-09 07:23:47,699 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2024-11-09 07:23:47,700 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 158 treesize of output 151 [2024-11-09 07:23:47,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 23 [2024-11-09 07:23:47,786 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 07:23:47,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 32 [2024-11-09 07:23:47,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:23:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:23:47,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:23:47,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= 2 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1050) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1048) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_1046 .cse0)) v_ArrVal_1046))))) is different from false [2024-11-09 07:23:48,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-09 07:23:48,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,028 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 540 treesize of output 526 [2024-11-09 07:23:48,049 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 108 treesize of output 72 [2024-11-09 07:23:48,125 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 358 treesize of output 322 [2024-11-09 07:23:48,134 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 21 treesize of output 3 [2024-11-09 07:23:48,159 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 21 treesize of output 3 [2024-11-09 07:23:48,171 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 379 treesize of output 325 [2024-11-09 07:23:48,192 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 358 treesize of output 322 [2024-11-09 07:23:48,245 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 30 treesize of output 22 [2024-11-09 07:23:48,255 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 33 treesize of output 25 [2024-11-09 07:23:48,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,429 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 34 treesize of output 35 [2024-11-09 07:23:48,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,441 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 107 treesize of output 106 [2024-11-09 07:23:48,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 90 treesize of output 82 [2024-11-09 07:23:48,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,459 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 93 treesize of output 61 [2024-11-09 07:23:48,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,547 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 28 treesize of output 29 [2024-11-09 07:23:48,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:23:48,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,566 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 44 treesize of output 38 [2024-11-09 07:23:48,571 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 26 treesize of output 22 [2024-11-09 07:23:48,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,596 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 29 treesize of output 30 [2024-11-09 07:23:48,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:23:48,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,610 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 36 treesize of output 35 [2024-11-09 07:23:48,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,630 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 22 treesize of output 22 [2024-11-09 07:23:48,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-09 07:23:48,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:23:48,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:48,659 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 38 treesize of output 31 [2024-11-09 07:23:48,665 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 11 treesize of output 7 [2024-11-09 07:23:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:23:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129770026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:23:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1476193670] [2024-11-09 07:23:49,629 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:23:49,630 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:23:49,630 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:23:49,630 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:23:49,630 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:23:50,529 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:24:12,288 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3622#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_131| Int) (|v_ULTIMATE.start_main_~p~0#1.base_140| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_140|) |v_ULTIMATE.start_main_~p~0#1.offset_131|) 1)) (not (= 3 (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_140|) |v_ULTIMATE.start_main_~p~0#1.offset_131|))))))' at error location [2024-11-09 07:24:12,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:24:12,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:24:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28 [2024-11-09 07:24:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309805393] [2024-11-09 07:24:12,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:24:12,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:24:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:24:12,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:24:12,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1775, Unknown=23, NotChecked=86, Total=2070 [2024-11-09 07:24:12,291 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 28 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) [2024-11-09 07:24:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:14,082 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2024-11-09 07:24:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:24:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 28 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) Word has length 35 [2024-11-09 07:24:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:14,084 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:24:14,084 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:24:14,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=265, Invalid=2471, Unknown=24, NotChecked=102, Total=2862 [2024-11-09 07:24:14,085 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:14,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 331 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 656 Invalid, 0 Unknown, 69 Unchecked, 1.4s Time] [2024-11-09 07:24:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:24:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2024-11-09 07:24:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:24:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2024-11-09 07:24:14,093 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 35 [2024-11-09 07:24:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:14,094 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2024-11-09 07:24:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 28 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) [2024-11-09 07:24:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2024-11-09 07:24:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:24:14,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:14,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:24:14,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:24:14,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 07:24:14,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:24:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1715354548, now seen corresponding path program 1 times [2024-11-09 07:24:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:24:14,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796120235] [2024-11-09 07:24:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:24:14,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:24:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:24:14,413 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 07:24:14,413 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:24:14,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 07:24:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:24:14,423 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:24:14,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:24:14,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:24:14 BoogieIcfgContainer [2024-11-09 07:24:14,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:24:14,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:24:14,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:24:14,470 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:24:14,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:20:01" (3/4) ... [2024-11-09 07:24:14,471 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:24:14,535 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 07:24:14,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:24:14,536 INFO L158 Benchmark]: Toolchain (without parser) took 255052.92ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 108.4MB in the beginning and 172.1MB in the end (delta: -63.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-09 07:24:14,536 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:24:14,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.31ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 87.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 07:24:14,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.12ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 85.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:24:14,536 INFO L158 Benchmark]: Boogie Preprocessor took 46.89ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:24:14,537 INFO L158 Benchmark]: RCFGBuilder took 1046.42ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 106.8MB in the end (delta: -23.8MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-09 07:24:14,537 INFO L158 Benchmark]: TraceAbstraction took 253216.69ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 106.1MB in the beginning and 175.3MB in the end (delta: -69.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-09 07:24:14,538 INFO L158 Benchmark]: Witness Printer took 65.70ms. Allocated memory is still 255.9MB. Free memory was 175.3MB in the beginning and 172.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:24:14,539 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.31ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 87.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.12ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 85.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.89ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1046.42ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 106.8MB in the end (delta: -23.8MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 253216.69ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 106.1MB in the beginning and 175.3MB in the end (delta: -69.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 65.70ms. Allocated memory is still 255.9MB. Free memory was 175.3MB in the beginning and 172.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 620]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) VAL [root={-1:0}] [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; VAL [root={-1:0}] [L576] COND FALSE !(\read(*root)) VAL [root={-1:0}] [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] EXPR n->left [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) [L576] COND TRUE \read(*root) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) VAL [a={-2:0}] [L597] List t; [L598] List p = a; VAL [a={-2:0}, p={-2:0}] [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) VAL [a={-2:0}, p={-2:0}, t={-3:0}] [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) VAL [a={-2:0}, p={-3:0}, t={-4:0}] [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a VAL [p={-2:0}] [L615] EXPR p->h VAL [p={-2:0}] [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h VAL [p={-2:0}] [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n VAL [p={-3:0}] [L617] EXPR p->h VAL [p={-3:0}] [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L620] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 253.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 2343 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 525 IncrementalHoareTripleChecker+Unchecked, 2009 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2951 IncrementalHoareTripleChecker+Invalid, 3621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 334 mSDtfsCounter, 2951 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 903 GetRequests, 538 SyntacticMatches, 14 SemanticMatches, 351 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4286 ImplicationChecksByTransitivity, 205.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=13, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 54 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 661 NumberOfCodeBlocks, 655 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 853 ConstructedInterpolants, 86 QuantifiedInterpolants, 9418 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1675 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 45/163 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 07:24:14,760 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 07:24:14,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f76f0468-f069-4857-a63b-014d2a6f3298/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE