./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:04:35,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:04:35,941 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 21:04:35,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:04:35,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:04:35,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:04:35,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:04:35,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:04:35,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:04:35,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:04:35,983 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 21:04:35,983 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 21:04:35,984 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 21:04:35,985 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 21:04:35,986 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 21:04:35,986 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 21:04:35,987 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 21:04:35,988 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 21:04:35,988 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 21:04:35,989 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 21:04:35,990 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 21:04:35,991 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 21:04:35,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:04:35,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:04:35,993 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:04:35,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:04:35,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:04:35,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:04:35,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:04:35,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:04:35,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:04:35,997 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:04:35,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:04:35,998 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:04:35,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:04:35,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:04:36,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:04:36,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:04:36,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:04:36,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:04:36,001 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 21:04:36,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:04:36,002 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:04:36,003 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 21:04:36,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:04:36,004 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_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/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_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2023-11-06 21:04:36,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:04:36,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:04:36,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:04:36,373 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:04:36,374 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:04:36,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-06 21:04:39,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:04:39,957 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:04:39,958 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-06 21:04:39,974 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/data/9cbbfd4a7/da363321bc1b428bac49b18baf4d27ae/FLAGc79ed5cb7 [2023-11-06 21:04:39,989 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/data/9cbbfd4a7/da363321bc1b428bac49b18baf4d27ae [2023-11-06 21:04:39,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:04:39,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:04:39,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:04:39,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:04:40,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:04:40,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:39" (1/1) ... [2023-11-06 21:04:40,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac4ef4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40, skipping insertion in model container [2023-11-06 21:04:40,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:39" (1/1) ... [2023-11-06 21:04:40,073 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:04:40,428 WARN L240 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_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-06 21:04:40,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:04:40,448 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:04:40,486 WARN L240 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_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-06 21:04:40,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:04:40,522 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:04:40,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40 WrapperNode [2023-11-06 21:04:40,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:04:40,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:04:40,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:04:40,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:04:40,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,607 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2023-11-06 21:04:40,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:04:40,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:04:40,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:04:40,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:04:40,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:04:40,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:04:40,642 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:04:40,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:04:40,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (1/1) ... [2023-11-06 21:04:40,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:04:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:04:40,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:04:40,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:04:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:04:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:04:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:04:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:04:40,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:04:40,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:04:40,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:04:40,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:04:40,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:04:40,843 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:04:40,846 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:04:41,060 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:04:41,218 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:04:41,218 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 21:04:41,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:41 BoogieIcfgContainer [2023-11-06 21:04:41,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:04:41,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:04:41,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:04:41,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:04:41,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:04:39" (1/3) ... [2023-11-06 21:04:41,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4190fe46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:41, skipping insertion in model container [2023-11-06 21:04:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:40" (2/3) ... [2023-11-06 21:04:41,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4190fe46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:41, skipping insertion in model container [2023-11-06 21:04:41,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:41" (3/3) ... [2023-11-06 21:04:41,235 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2023-11-06 21:04:41,253 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:04:41,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:04:41,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:04:41,314 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@40efaca0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 21:04:41,315 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:04:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:04:41,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:04:41,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:04:41,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:04:41,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:04:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1698198648, now seen corresponding path program 1 times [2023-11-06 21:04:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:04:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001085415] [2023-11-06 21:04:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:04:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:04:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:04:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:04:41,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:04:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001085415] [2023-11-06 21:04:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001085415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:04:41,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:04:41,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:04:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102034448] [2023-11-06 21:04:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:04:41,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:04:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:04:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:04:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:04:41,741 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:04:41,795 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-06 21:04:41,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:04:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 21:04:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:04:41,810 INFO L225 Difference]: With dead ends: 15 [2023-11-06 21:04:41,810 INFO L226 Difference]: Without dead ends: 8 [2023-11-06 21:04:41,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:04:41,818 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:04:41,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:04:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-06 21:04:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-06 21:04:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-06 21:04:41,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2023-11-06 21:04:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:04:41,856 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-06 21:04:41,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-11-06 21:04:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 21:04:41,858 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:04:41,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:04:41,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:04:41,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:04:41,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:04:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1518656950, now seen corresponding path program 1 times [2023-11-06 21:04:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:04:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61732017] [2023-11-06 21:04:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:04:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:04:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:04:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:04:43,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:04:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61732017] [2023-11-06 21:04:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61732017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:04:43,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:04:43,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:04:43,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665786626] [2023-11-06 21:04:43,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:04:43,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:04:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:04:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:04:43,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:04:43,032 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:04:43,155 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-11-06 21:04:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:04:43,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-06 21:04:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:04:43,156 INFO L225 Difference]: With dead ends: 15 [2023-11-06 21:04:43,157 INFO L226 Difference]: Without dead ends: 13 [2023-11-06 21:04:43,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:04:43,159 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:04:43,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:04:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-06 21:04:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-06 21:04:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-06 21:04:43,166 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2023-11-06 21:04:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:04:43,166 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-06 21:04:43,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-06 21:04:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 21:04:43,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:04:43,168 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:04:43,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:04:43,169 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:04:43,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:04:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2058731945, now seen corresponding path program 1 times [2023-11-06 21:04:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:04:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564418104] [2023-11-06 21:04:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:04:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:04:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:04:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:04:44,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:04:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564418104] [2023-11-06 21:04:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564418104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:04:44,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296653354] [2023-11-06 21:04:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:04:44,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:04:44,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:04:44,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:04:44,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:04:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:04:44,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 21:04:44,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:04:44,624 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 21:04:44,625 INFO L351 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 1 case distinctions, treesize of input 34 treesize of output 19 [2023-11-06 21:04:44,635 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:04:44,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-11-06 21:04:44,660 INFO L351 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 18 treesize of output 7 [2023-11-06 21:04:44,687 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 21:04:44,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 21:04:44,708 INFO L351 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 18 treesize of output 7 [2023-11-06 21:04:45,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2023-11-06 21:04:45,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:45,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:45,124 INFO L351 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 26 treesize of output 23 [2023-11-06 21:04:45,131 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-06 21:04:45,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:45,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:45,220 INFO L351 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 26 treesize of output 23 [2023-11-06 21:04:45,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-06 21:04:45,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:45,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:45,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:45,310 INFO L322 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2023-11-06 21:04:45,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 21:04:45,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-06 21:04:45,374 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-06 21:04:45,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 89 [2023-11-06 21:04:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:04:45,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:04:46,244 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:04:46,244 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 39 [2023-11-06 21:04:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:04:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296653354] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:04:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1743728433] [2023-11-06 21:04:47,190 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-06 21:04:47,190 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 21:04:47,194 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 21:04:47,200 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 21:04:47,200 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 21:04:52,773 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 21:04:54,264 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse1 (select |v_#memory_int_79| .cse0)) (.cse2 (select (select |v_#memory_$Pointer$.offset_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse3 (select .cse1 .cse2))) (and (= (store |v_#memory_int_79| .cse0 (store .cse1 .cse2 (+ .cse3 (* (- 1) (select (select |v_#memory_int_79| |c_ULTIMATE.start_main_~head~0#1.base|) 0))))) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| .cse0 (store (select |v_#memory_$Pointer$.base_73| .cse0) .cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| .cse0 (store (select |v_#memory_$Pointer$.offset_73| .cse0) .cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2)))) (<= 101 .cse3)))))) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.base_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse7 (select |v_#memory_int_79| .cse4)) (.cse5 (select (select |v_#memory_$Pointer$.offset_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse6 (select .cse7 .cse5))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| .cse4 (store (select |v_#memory_$Pointer$.base_73| .cse4) .cse5 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)))) (<= .cse6 100) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| .cse4 (store (select |v_#memory_$Pointer$.offset_73| .cse4) .cse5 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)))) (= |c_#memory_int| (store |v_#memory_int_79| .cse4 (store .cse7 .cse5 (+ .cse6 (select (select |v_#memory_int_79| |c_ULTIMATE.start_main_~head~0#1.base|) 0))))))))))) (<= 1 |c_#StackHeapBarrier|) (= .cse8 |c_ULTIMATE.start_main_#t~mem17#1|) (exists ((|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_19| Int)) (let ((.cse9 (not |v_ULTIMATE.start_main_#t~short19#1_20|))) (and (or (and (<= |c_ULTIMATE.start_main_#t~mem17#1| 90) .cse9) (and |v_ULTIMATE.start_main_#t~short19#1_20| (<= 91 |c_ULTIMATE.start_main_#t~mem17#1|))) (let ((.cse10 (not |c_ULTIMATE.start_main_#t~short19#1|))) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_19| |c_ULTIMATE.start_main_#t~mem18#1|) .cse9 .cse10) (and |v_ULTIMATE.start_main_#t~short19#1_20| (= |c_ULTIMATE.start_main_#t~mem18#1| .cse8) (or (and |c_ULTIMATE.start_main_#t~short19#1| (<= |c_ULTIMATE.start_main_#t~mem18#1| 109)) (and .cse10 (<= 110 |c_ULTIMATE.start_main_#t~mem18#1|))))))))) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~list~0#1.offset|))) is different from true [2023-11-06 21:04:54,267 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '145#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~mem18#1_20| Int) (|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_19| Int)) (and (or |v_ULTIMATE.start_main_#t~short19#1_20| (< (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) 0) 91)) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_20| |v_ULTIMATE.start_main_#t~mem18#1_19|) (not |v_ULTIMATE.start_main_#t~short19#1_20|)) (and (= |v_ULTIMATE.start_main_#t~mem18#1_20| (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) 0)) (<= 110 |v_ULTIMATE.start_main_#t~mem18#1_20|))))) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 8) |ULTIMATE.start_main_~list~0#1.offset|) (or (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4))))) (<= 101 (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4))) (= |#memory_int| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (+ (* (- 1) (select (select |v_#memory_int_79| |ULTIMATE.start_main_~head~0#1.base|) 0)) (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))))) (= (store |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))) |#memory_$Pointer$.base|))) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4))))) (= |#memory_int| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (+ (select (select |v_#memory_int_79| |ULTIMATE.start_main_~head~0#1.base|) 0) (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))))) (<= (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) 100) (= (store |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))) |#memory_$Pointer$.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 8) |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~m~0#1.offset| 0))' at error location [2023-11-06 21:04:54,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 21:04:54,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:04:54,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-06 21:04:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48542707] [2023-11-06 21:04:54,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:04:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:04:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:04:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:04:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=220, Unknown=6, NotChecked=30, Total=306 [2023-11-06 21:04:54,271 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:04:55,232 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2023-11-06 21:04:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:04:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 21:04:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:04:55,233 INFO L225 Difference]: With dead ends: 17 [2023-11-06 21:04:55,233 INFO L226 Difference]: Without dead ends: 15 [2023-11-06 21:04:55,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=50, Invalid=220, Unknown=6, NotChecked=30, Total=306 [2023-11-06 21:04:55,236 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:04:55,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:04:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-06 21:04:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2023-11-06 21:04:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-06 21:04:55,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2023-11-06 21:04:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:04:55,242 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-06 21:04:55,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:04:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-06 21:04:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 21:04:55,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:04:55,243 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:04:55,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:04:55,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-06 21:04:55,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:04:55,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:04:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 859689689, now seen corresponding path program 1 times [2023-11-06 21:04:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:04:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266775550] [2023-11-06 21:04:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:04:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:04:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:04:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:04:57,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:04:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266775550] [2023-11-06 21:04:57,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266775550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:04:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899779372] [2023-11-06 21:04:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:04:57,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:04:57,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:04:57,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:04:57,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:04:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:04:57,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-06 21:04:57,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:04:57,492 INFO L351 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 14 treesize of output 15 [2023-11-06 21:04:57,508 INFO L351 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 10 treesize of output 8 [2023-11-06 21:04:57,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2023-11-06 21:04:57,550 INFO L351 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 14 treesize of output 15 [2023-11-06 21:04:57,866 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 21:04:57,867 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 144 [2023-11-06 21:04:57,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2023-11-06 21:04:57,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 135 [2023-11-06 21:04:57,921 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2023-11-06 21:04:58,237 INFO L322 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-11-06 21:04:58,238 INFO L351 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 250 [2023-11-06 21:04:58,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:04:58,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 187 [2023-11-06 21:04:58,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 179 [2023-11-06 21:04:58,366 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 94 [2023-11-06 21:04:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:04:58,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:04:58,560 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse5))) (let ((.cse2 (select |c_#memory_int| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse5))) (let ((.cse4 (select .cse2 .cse3))) (and (or (let ((.cse0 (select (select (store |c_#memory_int| .cse1 (store .cse2 .cse3 (+ .cse4 (* (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (and (<= .cse0 109) (<= 91 .cse0))) (< .cse4 101)) (or (< 100 .cse4) (and (forall ((v_DerPreprocessor_6 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse1 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (<= 91 (select (select (store |c_#memory_int| .cse1 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) is different from false [2023-11-06 21:04:59,437 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse66 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse66))) (let ((.cse64 (select |c_#memory_int| .cse11)) (.cse65 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse66))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (select .cse64 .cse65))) (and (or (< .cse0 101) (and (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_10))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_9))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse9 (+ .cse7 4))) (let ((.cse1 (store |c_#memory_int| .cse11 v_DerPreprocessor_11)) (.cse2 (select (select .cse10 .cse6) .cse9))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse8 .cse6) .cse9))) (let ((.cse5 (select .cse3 .cse4))) (or (< 90 (select (select (store .cse1 .cse2 (store .cse3 .cse4 (+ .cse5 (* (- 1) (select (select .cse1 .cse6) .cse7))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse5 101))))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_10)) (.cse18 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_9))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse17 (+ (select (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12) 4))) (let ((.cse13 (store |c_#memory_int| .cse11 v_DerPreprocessor_11)) (.cse14 (select (select .cse18 .cse16) .cse17))) (or (forall ((v_DerPreprocessor_6 (Array Int Int))) (<= (select (select (store .cse13 .cse14 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse13 .cse14) (select (select .cse15 .cse16) .cse17)))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_10)) (.cse24 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_9))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse23 (+ (select (select .cse21 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12) 4))) (let ((.cse19 (store |c_#memory_int| .cse11 v_DerPreprocessor_11)) (.cse20 (select (select .cse24 .cse22) .cse23))) (or (forall ((v_prenex_15 (Array Int Int))) (<= 91 (select (select (store .cse19 .cse20 v_prenex_15) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (< 100 (select (select .cse19 .cse20) (select (select .cse21 .cse22) .cse23)))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_10))) (let ((.cse31 (select (select .cse32 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse34 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_9))) (let ((.cse30 (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse33 (+ .cse31 4))) (let ((.cse25 (store |c_#memory_int| .cse11 v_DerPreprocessor_11)) (.cse26 (select (select .cse34 .cse30) .cse33))) (let ((.cse27 (select .cse25 .cse26)) (.cse28 (select (select .cse32 .cse30) .cse33))) (let ((.cse29 (select .cse27 .cse28))) (or (< (select (select (store .cse25 .cse26 (store .cse27 .cse28 (+ .cse29 (* (- 1) (select (select .cse25 .cse30) .cse31))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse29 101))))))))))) (or (< 100 .cse0) (let ((.cse36 (store |c_#memory_int| .cse11 (store .cse64 .cse65 (+ .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (and (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_8))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse44 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_7))) (let ((.cse40 (select (select .cse44 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse43 (+ .cse41 4))) (let ((.cse37 (select (select .cse44 .cse40) .cse43))) (let ((.cse38 (select .cse36 .cse37)) (.cse39 (select (select .cse42 .cse40) .cse43))) (let ((.cse35 (select .cse38 .cse39))) (or (< .cse35 101) (< 90 (select (select (store .cse36 .cse37 (store .cse38 .cse39 (+ .cse35 (* (- 1) (select (select .cse36 .cse40) .cse41))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_8)) (.cse49 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_7))) (let ((.cse47 (select (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse48 (+ (select (select .cse46 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12) 4))) (let ((.cse45 (select (select .cse49 .cse47) .cse48))) (or (< 100 (select (select .cse36 .cse45) (select (select .cse46 .cse47) .cse48))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (<= (select (select (store .cse36 .cse45 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_8))) (let ((.cse55 (select (select .cse56 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse58 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_7))) (let ((.cse54 (select (select .cse58 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse57 (+ .cse55 4))) (let ((.cse50 (select (select .cse58 .cse54) .cse57))) (let ((.cse51 (select .cse36 .cse50)) (.cse52 (select (select .cse56 .cse54) .cse57))) (let ((.cse53 (select .cse51 .cse52))) (or (< (select (select (store .cse36 .cse50 (store .cse51 .cse52 (+ .cse53 (* (- 1) (select (select .cse36 .cse54) .cse55))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse53 101))))))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_8)) (.cse63 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_7))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse62 (+ (select (select .cse60 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12) 4))) (let ((.cse59 (select (select .cse63 .cse61) .cse62))) (or (< 100 (select (select .cse36 .cse59) (select (select .cse60 .cse61) .cse62))) (forall ((v_prenex_14 (Array Int Int))) (<= 91 (select (select (store .cse36 .cse59 v_prenex_14) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))))))))) is different from false [2023-11-06 21:04:59,951 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse66 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse66))) (let ((.cse64 (select |c_#memory_int| .cse10)) (.cse65 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse66))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse34 (select .cse64 .cse65))) (and (or (and (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_10))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_9))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse0 (store |c_#memory_int| .cse10 v_DerPreprocessor_11)) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (< (select (select (store .cse0 .cse1 (store .cse2 .cse3 (+ .cse4 (* (- 1) (select (select .cse0 .cse5) .cse6))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse4 101))))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_10))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse21 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_9))) (let ((.cse17 (select (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse20 (+ .cse18 4))) (let ((.cse12 (store |c_#memory_int| .cse10 v_DerPreprocessor_11)) (.cse13 (select (select .cse21 .cse17) .cse20))) (let ((.cse14 (select .cse12 .cse13)) (.cse15 (select (select .cse19 .cse17) .cse20))) (let ((.cse16 (select .cse14 .cse15))) (or (< 90 (select (select (store .cse12 .cse13 (store .cse14 .cse15 (+ .cse16 (* (- 1) (select (select .cse12 .cse17) .cse18))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse16 101))))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_10)) (.cse27 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_9))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse26 (+ (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11) 4))) (let ((.cse22 (store |c_#memory_int| .cse10 v_DerPreprocessor_11)) (.cse23 (select (select .cse27 .cse25) .cse26))) (or (< 100 (select (select .cse22 .cse23) (select (select .cse24 .cse25) .cse26))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (<= (select (select (store .cse22 .cse23 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_10)) (.cse33 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_9))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse32 (+ (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11) 4))) (let ((.cse28 (store |c_#memory_int| .cse10 v_DerPreprocessor_11)) (.cse29 (select (select .cse33 .cse31) .cse32))) (or (< 100 (select (select .cse28 .cse29) (select (select .cse30 .cse31) .cse32))) (forall ((v_prenex_15 (Array Int Int))) (<= 91 (select (select (store .cse28 .cse29 v_prenex_15) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))) (< .cse34 101)) (or (< 100 .cse34) (let ((.cse36 (store |c_#memory_int| .cse10 (store .cse64 .cse65 (+ .cse34 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_8))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse44 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_7))) (let ((.cse40 (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse43 (+ 4 .cse41))) (let ((.cse37 (select (select .cse44 .cse40) .cse43))) (let ((.cse38 (select .cse36 .cse37)) (.cse39 (select (select .cse42 .cse40) .cse43))) (let ((.cse35 (select .cse38 .cse39))) (or (< .cse35 101) (< 90 (select (select (store .cse36 .cse37 (store .cse38 .cse39 (+ .cse35 (* (- 1) (select (select .cse36 .cse40) .cse41))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_8))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse53 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_7))) (let ((.cse49 (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse52 (+ 4 .cse50))) (let ((.cse46 (select (select .cse53 .cse49) .cse52))) (let ((.cse47 (select .cse36 .cse46)) (.cse48 (select (select .cse51 .cse49) .cse52))) (let ((.cse45 (select .cse47 .cse48))) (or (< .cse45 101) (< (select (select (store .cse36 .cse46 (store .cse47 .cse48 (+ .cse45 (* (- 1) (select (select .cse36 .cse49) .cse50))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_8)) (.cse58 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_7))) (let ((.cse56 (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse57 (+ 4 (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)))) (let ((.cse54 (select (select .cse58 .cse56) .cse57))) (or (forall ((v_DerPreprocessor_6 (Array Int Int))) (<= (select (select (store .cse36 .cse54 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse36 .cse54) (select (select .cse55 .cse56) .cse57)))))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_8)) (.cse63 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_7))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse62 (+ 4 (select (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)))) (let ((.cse59 (select (select .cse63 .cse61) .cse62))) (or (forall ((v_prenex_14 (Array Int Int))) (<= 91 (select (select (store .cse36 .cse59 v_prenex_14) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (< 100 (select (select .cse36 .cse59) (select (select .cse60 .cse61) .cse62)))))))))))))))) is different from false [2023-11-06 21:05:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 21:05:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899779372] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:05:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1423855349] [2023-11-06 21:05:00,300 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-06 21:05:00,301 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 21:05:00,301 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 21:05:00,301 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 21:05:00,302 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 21:05:04,561 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 21:05:05,747 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '247#(and (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem10#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem13#1.base_31| Int) (|v_ULTIMATE.start_main_#t~mem15#1_31| Int) (|v_ULTIMATE.start_main_#t~mem11#1_31| Int) (|v_ULTIMATE.start_main_~list~0#1.base_43| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_31| Int) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem14#1_31| Int) (|v_ULTIMATE.start_main_#t~mem10#1.base_31| Int) (|v_ULTIMATE.start_main_#t~mem12#1_31| Int) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~list~0#1.offset_44| Int)) (and (or (not (= |v_ULTIMATE.start_main_~list~0#1.offset_44| 0)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_43| 0))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (or (and (= |ULTIMATE.start_main_#t~mem11#1| |v_ULTIMATE.start_main_#t~mem11#1_31|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (<= 101 (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))) (= |ULTIMATE.start_main_#t~mem10#1.offset| |v_ULTIMATE.start_main_#t~mem10#1.offset_31|) (= |ULTIMATE.start_main_#t~mem12#1| |v_ULTIMATE.start_main_#t~mem12#1_31|) (= |#memory_int| (store |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (+ (* (- 1) (select (select |v_#memory_int_91| |v_ULTIMATE.start_main_~list~0#1.base_43|) |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (= |ULTIMATE.start_main_#t~mem10#1.base| |v_ULTIMATE.start_main_#t~mem10#1.base_31|)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (= |ULTIMATE.start_main_#t~mem15#1| |v_ULTIMATE.start_main_#t~mem15#1_31|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |v_ULTIMATE.start_main_#t~mem13#1.offset_31|) (= |ULTIMATE.start_main_#t~mem14#1| |v_ULTIMATE.start_main_#t~mem14#1_31|) (= |#memory_int| (store |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (+ (select (select |v_#memory_int_91| |v_ULTIMATE.start_main_~list~0#1.base_43|) |v_ULTIMATE.start_main_~list~0#1.offset_44|) (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))))) (= |ULTIMATE.start_main_#t~mem13#1.base| |v_ULTIMATE.start_main_#t~mem13#1.base_31|) (<= (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) 100) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))))))) (exists ((|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_28| Int) (|v_ULTIMATE.start_main_#t~mem18#1_29| Int)) (and (or (< (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) 91) |v_ULTIMATE.start_main_#t~short19#1_20|) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_29| (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|)) (<= 110 |v_ULTIMATE.start_main_#t~mem18#1_29|)) (and (not |v_ULTIMATE.start_main_#t~short19#1_20|) (= |v_ULTIMATE.start_main_#t~mem18#1_29| |v_ULTIMATE.start_main_#t~mem18#1_28|))))))' at error location [2023-11-06 21:05:05,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 21:05:05,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:05:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-11-06 21:05:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495406989] [2023-11-06 21:05:05,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:05:05,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:05:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:05,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:05:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=140, Unknown=7, NotChecked=78, Total=272 [2023-11-06 21:05:05,751 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:05:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:06,737 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-11-06 21:05:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:05:06,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 21:05:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:06,739 INFO L225 Difference]: With dead ends: 21 [2023-11-06 21:05:06,739 INFO L226 Difference]: Without dead ends: 12 [2023-11-06 21:05:06,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=86, Invalid=260, Unknown=8, NotChecked=108, Total=462 [2023-11-06 21:05:06,741 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:06,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 46 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2023-11-06 21:05:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-06 21:05:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-06 21:05:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:05:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-11-06 21:05:06,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2023-11-06 21:05:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:06,747 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-06 21:05:06,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:05:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-11-06 21:05:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 21:05:06,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:06,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:06,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 21:05:06,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be1db9d-3a90-4625-9db6-9f43d9fa9b95/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:05:06,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:05:06,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1538386312, now seen corresponding path program 1 times [2023-11-06 21:05:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351602685] [2023-11-06 21:05:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat