./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 cf1a7837 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_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:52:44,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:52:44,960 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:52:44,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:52:44,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:52:45,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:52:45,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:52:45,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:52:45,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:52:45,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:52:45,045 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:52:45,046 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:52:45,046 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:52:45,048 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:52:45,049 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:52:45,049 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:52:45,050 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:52:45,050 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:52:45,051 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:52:45,052 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:52:45,052 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:52:45,053 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:52:45,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:52:45,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:52:45,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:52:45,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:52:45,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:52:45,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:52:45,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:52:45,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:52:45,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:52:45,060 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:52:45,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:52:45,061 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:52:45,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:52:45,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:52:45,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:45,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:52:45,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:52:45,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:52:45,073 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:52:45,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:52:45,074 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:52:45,074 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:52:45,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:52:45,075 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_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/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_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2023-11-12 00:52:45,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:52:45,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:52:45,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:52:45,439 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:52:45,441 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:52:45,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-12 00:52:48,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:52:48,918 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:52:48,919 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-12 00:52:48,943 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/data/020a62d0b/6946bd744f8f4b778d008e6e2d8e2460/FLAG58eb2f6b2 [2023-11-12 00:52:48,960 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/data/020a62d0b/6946bd744f8f4b778d008e6e2d8e2460 [2023-11-12 00:52:48,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:52:48,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:52:48,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:48,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:52:48,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:52:48,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:48" (1/1) ... [2023-11-12 00:52:48,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505c95c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:48, skipping insertion in model container [2023-11-12 00:52:48,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:48" (1/1) ... [2023-11-12 00:52:49,024 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:52:49,440 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_1dfa2550-e331-4b52-809f-7ebee9c9197e/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-12 00:52:49,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:49,460 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:52:49,544 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_1dfa2550-e331-4b52-809f-7ebee9c9197e/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-12 00:52:49,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:49,593 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:52:49,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49 WrapperNode [2023-11-12 00:52:49,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:49,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:52:49,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:52:49,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:52:49,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,670 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2023-11-12 00:52:49,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:52:49,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:52:49,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:52:49,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:52:49,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:52:49,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:52:49,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:52:49,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:52:49,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (1/1) ... [2023-11-12 00:52:49,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:49,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:52:49,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:52:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:52:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:52:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:52:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:52:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:52:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:52:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:52:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:52:49,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:52:50,053 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:52:50,055 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:52:50,318 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:52:50,440 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:52:50,440 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:52:50,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:52:50 BoogieIcfgContainer [2023-11-12 00:52:50,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:52:50,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:52:50,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:52:50,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:52:50,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:52:48" (1/3) ... [2023-11-12 00:52:50,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7618f61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:52:50, skipping insertion in model container [2023-11-12 00:52:50,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:49" (2/3) ... [2023-11-12 00:52:50,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7618f61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:52:50, skipping insertion in model container [2023-11-12 00:52:50,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:52:50" (3/3) ... [2023-11-12 00:52:50,464 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2023-11-12 00:52:50,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:52:50,491 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:52:50,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:52:50,562 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a21ae2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:52:50,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:52:50,567 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-12 00:52:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:52:50,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:50,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:52:50,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:52:50,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1698198648, now seen corresponding path program 1 times [2023-11-12 00:52:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:50,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794565131] [2023-11-12 00:52:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:50,866 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-12 00:52:50,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794565131] [2023-11-12 00:52:50,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794565131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:50,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:50,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:52:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832233482] [2023-11-12 00:52:50,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:52:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:52:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:52:50,921 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-12 00:52:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:50,972 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-12 00:52:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:52:50,976 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-12 00:52:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:50,987 INFO L225 Difference]: With dead ends: 15 [2023-11-12 00:52:50,987 INFO L226 Difference]: Without dead ends: 8 [2023-11-12 00:52:50,991 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-12 00:52:51,000 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-12 00:52:51,001 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-12 00:52:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-12 00:52:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-12 00:52:51,041 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-12 00:52:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-12 00:52:51,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2023-11-12 00:52:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:51,045 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-12 00:52:51,045 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-12 00:52:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-11-12 00:52:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:52:51,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:51,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:52:51,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:52:51,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1518656950, now seen corresponding path program 1 times [2023-11-12 00:52:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447581594] [2023-11-12 00:52:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:51,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:52,155 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-12 00:52:52,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447581594] [2023-11-12 00:52:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447581594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:52,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:52:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646694295] [2023-11-12 00:52:52,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:52,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:52:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:52,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:52:52,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:52,160 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-12 00:52:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:52,271 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-11-12 00:52:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:52:52,272 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-12 00:52:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:52,272 INFO L225 Difference]: With dead ends: 15 [2023-11-12 00:52:52,273 INFO L226 Difference]: Without dead ends: 13 [2023-11-12 00:52:52,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:52:52,275 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-12 00:52:52,275 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-12 00:52:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-12 00:52:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-12 00:52:52,280 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-12 00:52:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-12 00:52:52,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2023-11-12 00:52:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:52,281 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-12 00:52:52,282 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-12 00:52:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-12 00:52:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:52:52,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:52,283 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:52,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:52:52,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:52:52,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2058731945, now seen corresponding path program 1 times [2023-11-12 00:52:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504009105] [2023-11-12 00:52:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:53,630 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-12 00:52:53,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:53,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504009105] [2023-11-12 00:52:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504009105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:53,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23105694] [2023-11-12 00:52:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:53,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:53,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:53,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:53,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:52:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:53,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-12 00:52:53,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:53,940 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:52:53,942 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-12 00:52:53,952 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:52:53,952 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-12 00:52:53,976 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-12 00:52:54,001 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:52:54,001 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-12 00:52:54,022 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-12 00:52:54,413 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-12 00:52:54,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:54,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:54,473 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-12 00:52:54,479 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-12 00:52:54,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:54,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:54,543 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-12 00:52:54,550 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-12 00:52:54,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:54,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:54,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:54,633 INFO L322 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2023-11-12 00:52:54,633 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-12 00:52:54,640 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-12 00:52:54,698 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-12 00:52:54,699 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-12 00:52:54,967 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-12 00:52:54,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:55,533 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:52:55,533 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-12 00:52:56,620 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-12 00:52:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23105694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:56,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472654725] [2023-11-12 00:52:56,654 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-12 00:52:56,654 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:56,659 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:52:56,666 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:52:56,666 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:53:02,543 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:53:07,316 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-12 00:53:07,317 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:53:07,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:53:07,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-12 00:53:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75955463] [2023-11-12 00:53:07,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:07,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:53:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:07,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:53:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=250, Unknown=6, NotChecked=0, Total=306 [2023-11-12 00:53:07,328 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-12 00:53:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:08,185 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2023-11-12 00:53:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:53:08,186 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-12 00:53:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:08,187 INFO L225 Difference]: With dead ends: 17 [2023-11-12 00:53:08,187 INFO L226 Difference]: Without dead ends: 15 [2023-11-12 00:53:08,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=50, Invalid=250, Unknown=6, NotChecked=0, Total=306 [2023-11-12 00:53:08,189 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:08,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 00:53:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-12 00:53:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2023-11-12 00:53:08,195 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-12 00:53:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-12 00:53:08,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2023-11-12 00:53:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:08,203 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-12 00:53:08,203 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-12 00:53:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-12 00:53:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:53:08,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:08,204 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:08,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:08,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:08,412 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:53:08,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 859689689, now seen corresponding path program 1 times [2023-11-12 00:53:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483117510] [2023-11-12 00:53:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:10,247 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-12 00:53:10,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483117510] [2023-11-12 00:53:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483117510] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689028746] [2023-11-12 00:53:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:10,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:10,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:10,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:10,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:53:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:10,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-12 00:53:10,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:10,400 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-12 00:53:10,422 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-12 00:53:10,462 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-12 00:53:10,479 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-12 00:53:10,892 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:53:10,892 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-12 00:53:10,912 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-12 00:53:10,932 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-12 00:53:10,960 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-12 00:53:11,329 INFO L322 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-11-12 00:53:11,329 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-12 00:53:11,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:11,367 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-12 00:53:11,389 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-12 00:53:11,412 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-12 00:53:11,458 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-12 00:53:11,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:11,729 WARN L854 $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-12 00:53:12,430 WARN L854 $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-12 00:53:12,733 WARN L854 $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-12 00:53:13,146 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-12 00:53:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689028746] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375115142] [2023-11-12 00:53:13,149 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-12 00:53:13,150 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:53:13,150 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:53:13,150 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:53:13,150 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:53:17,431 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:53:18,709 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-12 00:53:18,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:53:18,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:53:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-11-12 00:53:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343568919] [2023-11-12 00:53:18,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:18,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 00:53:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 00:53:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=142, Unknown=5, NotChecked=78, Total=272 [2023-11-12 00:53:18,714 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-12 00:53:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:19,985 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-11-12 00:53:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:53:19,989 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-12 00:53:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:19,990 INFO L225 Difference]: With dead ends: 21 [2023-11-12 00:53:19,990 INFO L226 Difference]: Without dead ends: 12 [2023-11-12 00:53:19,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=86, Invalid=262, Unknown=6, NotChecked=108, Total=462 [2023-11-12 00:53:19,992 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:19,992 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.3s Time] [2023-11-12 00:53:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-12 00:53:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-12 00:53:19,998 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-12 00:53:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-11-12 00:53:19,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2023-11-12 00:53:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:19,999 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-12 00:53:20,000 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-12 00:53:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-11-12 00:53:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:53:20,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:20,001 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:20,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:20,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:20,207 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:53:20,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1538386312, now seen corresponding path program 1 times [2023-11-12 00:53:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579736483] [2023-11-12 00:53:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:24,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579736483] [2023-11-12 00:53:24,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579736483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:24,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675799837] [2023-11-12 00:53:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:24,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:24,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:24,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:24,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:53:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:24,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-12 00:53:24,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:24,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-11-12 00:53:24,583 INFO L322 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2023-11-12 00:53:24,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 40 [2023-11-12 00:53:24,665 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:53:24,666 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-12 00:53:24,693 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-12 00:53:24,711 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-12 00:53:25,083 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 53 treesize of output 52 [2023-11-12 00:53:25,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 61 treesize of output 60 [2023-11-12 00:53:25,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:25,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:25,227 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2023-11-12 00:53:25,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2023-11-12 00:53:25,417 INFO L322 Elim1Store]: treesize reduction 139, result has 9.2 percent of original size [2023-11-12 00:53:25,418 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 396 treesize of output 360 [2023-11-12 00:53:25,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 315 [2023-11-12 00:53:25,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:25,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:53:25,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 21 [2023-11-12 00:53:25,895 INFO L322 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-11-12 00:53:25,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 259 [2023-11-12 00:53:27,259 INFO L322 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-12 00:53:27,260 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 422 treesize of output 365 [2023-11-12 00:53:27,343 INFO L322 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-11-12 00:53:27,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 381 [2023-11-12 00:53:27,484 INFO L322 Elim1Store]: treesize reduction 280, result has 6.0 percent of original size [2023-11-12 00:53:27,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 386 treesize of output 373 [2023-11-12 00:53:27,539 INFO L322 Elim1Store]: treesize reduction 55, result has 5.2 percent of original size [2023-11-12 00:53:27,539 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 353 treesize of output 333 [2023-11-12 00:53:28,924 INFO L322 Elim1Store]: treesize reduction 73, result has 41.6 percent of original size [2023-11-12 00:53:28,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 367 treesize of output 363 [2023-11-12 00:53:29,059 INFO L217 Elim1Store]: Index analysis took 105 ms [2023-11-12 00:53:29,698 INFO L322 Elim1Store]: treesize reduction 658, result has 19.2 percent of original size [2023-11-12 00:53:29,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 42 case distinctions, treesize of input 297 treesize of output 426 [2023-11-12 00:53:29,927 INFO L322 Elim1Store]: treesize reduction 102, result has 34.2 percent of original size [2023-11-12 00:53:29,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 254 treesize of output 275 [2023-11-12 00:53:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:30,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:30,896 WARN L854 $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 ((.cse58 (select .cse64 .cse65))) (let ((.cse1 (store |c_#memory_int| .cse11 (store .cse64 .cse65 (+ .cse58 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_21))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse9 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_20))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse8 (+ .cse6 4))) (let ((.cse2 (select (select .cse9 .cse5) .cse8))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse7 .cse5) .cse8))) (let ((.cse0 (select .cse3 .cse4))) (or (< .cse0 101) (< (select (select (store .cse1 .cse2 (store .cse3 .cse4 (+ (* (- 1) (select (select .cse1 .cse5) .cse6)) .cse0))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_21))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse20 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_20))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse19 (+ .cse16 4))) (let ((.cse12 (select (select .cse20 .cse15) .cse19))) (let ((.cse13 (select .cse1 .cse12)) (.cse14 (select (select .cse18 .cse15) .cse19))) (let ((.cse17 (select .cse13 .cse14))) (or (< 90 (select (select (store .cse1 .cse12 (store .cse13 .cse14 (+ (* (- 1) (select (select .cse1 .cse15) .cse16)) .cse17))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse17 101))))))))) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_21)) (.cse25 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_20))) (let ((.cse23 (select (select .cse25 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse24 (+ (select (select .cse22 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10) 4))) (let ((.cse21 (select (select .cse25 .cse23) .cse24))) (or (< 100 (select (select .cse1 .cse21) (select (select .cse22 .cse23) .cse24))) (forall ((v_DerPreprocessor_16 (Array Int Int))) (<= 91 (select (select (store .cse1 .cse21 v_DerPreprocessor_16) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))) (or (and (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_18))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse35 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_17))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse34 (+ .cse31 4))) (let ((.cse26 (store |c_#memory_int| .cse11 v_DerPreprocessor_19)) (.cse27 (select (select .cse35 .cse30) .cse34))) (let ((.cse28 (select .cse26 .cse27)) (.cse29 (select (select .cse33 .cse30) .cse34))) (let ((.cse32 (select .cse28 .cse29))) (or (< (select (select (store .cse26 .cse27 (store .cse28 .cse29 (+ (* (- 1) (select (select .cse26 .cse30) .cse31)) .cse32))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse32 101))))))))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_18))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse45 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_17))) (let ((.cse41 (select (select .cse45 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse44 (+ .cse42 4))) (let ((.cse37 (store |c_#memory_int| .cse11 v_DerPreprocessor_19)) (.cse38 (select (select .cse45 .cse41) .cse44))) (let ((.cse39 (select .cse37 .cse38)) (.cse40 (select (select .cse43 .cse41) .cse44))) (let ((.cse36 (select .cse39 .cse40))) (or (< .cse36 101) (< 90 (select (select (store .cse37 .cse38 (store .cse39 .cse40 (+ (* (- 1) (select (select .cse37 .cse41) .cse42)) .cse36))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_18)) (.cse51 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_17))) (let ((.cse49 (select (select .cse51 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse50 (+ (select (select .cse48 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10) 4))) (let ((.cse46 (store |c_#memory_int| .cse11 v_DerPreprocessor_19)) (.cse47 (select (select .cse51 .cse49) .cse50))) (or (forall ((v_DerPreprocessor_16 (Array Int Int))) (<= (select (select (store .cse46 .cse47 v_DerPreprocessor_16) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse46 .cse47) (select (select .cse48 .cse49) .cse50)))))))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_18)) (.cse57 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_17))) (let ((.cse55 (select (select .cse57 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse56 (+ (select (select .cse54 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10) 4))) (let ((.cse52 (store |c_#memory_int| .cse11 v_DerPreprocessor_19)) (.cse53 (select (select .cse57 .cse55) .cse56))) (or (< 100 (select (select .cse52 .cse53) (select (select .cse54 .cse55) .cse56))) (forall ((v_prenex_23 (Array Int Int))) (<= 91 (select (select (store .cse52 .cse53 v_prenex_23) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))) (< .cse58 101)) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_21)) (.cse63 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_20))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10)) (.cse62 (+ (select (select .cse60 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10) 4))) (let ((.cse59 (select (select .cse63 .cse61) .cse62))) (or (forall ((v_prenex_24 (Array Int Int))) (<= (select (select (store .cse1 .cse59 v_prenex_24) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse1 .cse59) (select (select .cse60 .cse61) .cse62)))))))))))))) is different from false [2023-11-12 00:53:36,756 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:36,756 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 44 treesize of output 45 [2023-11-12 00:53:36,794 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:36,794 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 50 treesize of output 51 [2023-11-12 00:53:37,065 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Complicated and unsupported kind of self-update: (store |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) v_arrayElimArr_26) [2023-11-12 00:53:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601154188] [2023-11-12 00:53:37,071 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-12 00:53:37,071 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:53:37,071 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:53:37,072 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:53:37,072 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:53:37,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 00:53:37,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:37,297 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3779e528 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:62) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.newQuantifier(SymbolicTools.java:284) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.projectExistentially(SymbolicTools.java:270) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:117) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:53:37,308 INFO L158 Benchmark]: Toolchain (without parser) took 48342.29ms. Allocated memory was 148.9MB in the beginning and 377.5MB in the end (delta: 228.6MB). Free memory was 115.5MB in the beginning and 311.5MB in the end (delta: -196.0MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2023-11-12 00:53:37,308 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:53:37,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.85ms. Allocated memory is still 148.9MB. Free memory was 115.0MB in the beginning and 98.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 00:53:37,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.75ms. Allocated memory is still 148.9MB. Free memory was 98.2MB in the beginning and 96.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:53:37,312 INFO L158 Benchmark]: Boogie Preprocessor took 111.55ms. Allocated memory is still 148.9MB. Free memory was 96.0MB in the beginning and 117.4MB in the end (delta: -21.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:53:37,313 INFO L158 Benchmark]: RCFGBuilder took 659.10ms. Allocated memory is still 148.9MB. Free memory was 116.8MB in the beginning and 94.5MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-12 00:53:37,313 INFO L158 Benchmark]: TraceAbstraction took 46859.70ms. Allocated memory was 148.9MB in the beginning and 377.5MB in the end (delta: 228.6MB). Free memory was 93.9MB in the beginning and 311.5MB in the end (delta: -217.6MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-11-12 00:53:37,316 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.85ms. Allocated memory is still 148.9MB. Free memory was 115.0MB in the beginning and 98.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.75ms. Allocated memory is still 148.9MB. Free memory was 98.2MB in the beginning and 96.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.55ms. Allocated memory is still 148.9MB. Free memory was 96.0MB in the beginning and 117.4MB in the end (delta: -21.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 659.10ms. Allocated memory is still 148.9MB. Free memory was 116.8MB in the beginning and 94.5MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 46859.70ms. Allocated memory was 148.9MB in the beginning and 377.5MB in the end (delta: 228.6MB). Free memory was 93.9MB in the beginning and 311.5MB in the end (delta: -217.6MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3779e528 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3779e528: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-12 00:53:37,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dfa2550-e331-4b52-809f-7ebee9c9197e/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...