./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:31:07,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:31:07,150 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:31:07,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:31:07,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:31:07,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:31:07,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:31:07,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:31:07,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:31:07,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:31:07,200 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:31:07,200 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:31:07,201 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:31:07,201 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:31:07,202 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:31:07,203 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:31:07,203 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:31:07,204 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:31:07,204 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:31:07,205 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:31:07,205 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:31:07,206 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:31:07,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:31:07,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:31:07,208 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:31:07,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:31:07,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:31:07,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:31:07,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:31:07,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:31:07,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:31:07,221 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:31:07,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:31:07,222 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:31:07,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:31:07,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:31:07,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:31:07,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:31:07,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:31:07,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:31:07,225 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:31:07,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:31:07,225 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:31:07,226 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:31:07,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:31:07,227 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_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2023-11-06 20:31:07,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:31:07,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:31:07,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:31:07,605 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:31:07,606 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:31:07,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-11-06 20:31:10,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:31:11,133 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:31:11,134 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/sv-benchmarks/c/systemc/transmitter.01.cil.c [2023-11-06 20:31:11,149 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/data/27ab7e5b9/32552638174540088adb36173365b66b/FLAG24629b734 [2023-11-06 20:31:11,168 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/data/27ab7e5b9/32552638174540088adb36173365b66b [2023-11-06 20:31:11,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:31:11,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:31:11,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:31:11,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:31:11,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:31:11,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b11a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11, skipping insertion in model container [2023-11-06 20:31:11,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,242 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:31:11,439 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_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-11-06 20:31:11,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:31:11,534 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:31:11,547 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_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2023-11-06 20:31:11,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:31:11,612 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:31:11,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11 WrapperNode [2023-11-06 20:31:11,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:31:11,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:31:11,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:31:11,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:31:11,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,657 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2023-11-06 20:31:11,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:31:11,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:31:11,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:31:11,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:31:11,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:31:11,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:31:11,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:31:11,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:31:11,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:31:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:31:11,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:31:11,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:31:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:31:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-06 20:31:11,785 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-06 20:31:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-06 20:31:11,785 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-06 20:31:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 20:31:11,785 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 20:31:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-06 20:31:11,786 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-06 20:31:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:31:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-06 20:31:11,786 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-06 20:31:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:31:11,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:31:11,875 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:31:11,878 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:31:12,213 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:31:12,442 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:31:12,443 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 20:31:12,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:12 BoogieIcfgContainer [2023-11-06 20:31:12,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:31:12,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:31:12,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:31:12,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:31:12,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:31:11" (1/3) ... [2023-11-06 20:31:12,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a5c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:12, skipping insertion in model container [2023-11-06 20:31:12,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11" (2/3) ... [2023-11-06 20:31:12,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a5c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:12, skipping insertion in model container [2023-11-06 20:31:12,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:12" (3/3) ... [2023-11-06 20:31:12,462 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2023-11-06 20:31:12,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:31:12,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 20:31:12,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:31:12,573 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@134dcb49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:31:12,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 20:31:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 46 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 20:31:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 20:31:12,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:12,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:12,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:31:12,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash 706510072, now seen corresponding path program 1 times [2023-11-06 20:31:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:12,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840971111] [2023-11-06 20:31:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:31:13,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:13,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840971111] [2023-11-06 20:31:13,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840971111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:31:13,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580640698] [2023-11-06 20:31:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:13,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:31:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:31:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:31:13,106 INFO L87 Difference]: Start difference. First operand has 64 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 46 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 20:31:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:13,404 INFO L93 Difference]: Finished difference Result 175 states and 248 transitions. [2023-11-06 20:31:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:31:13,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-11-06 20:31:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:13,420 INFO L225 Difference]: With dead ends: 175 [2023-11-06 20:31:13,420 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 20:31:13,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:31:13,428 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 134 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:13,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 182 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:31:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 20:31:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2023-11-06 20:31:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 78 states have internal predecessors, (98), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 20:31:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2023-11-06 20:31:13,507 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 140 transitions. Word has length 33 [2023-11-06 20:31:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:13,508 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 140 transitions. [2023-11-06 20:31:13,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 20:31:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2023-11-06 20:31:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 20:31:13,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:13,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:13,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:31:13,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:31:13,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1486491001, now seen corresponding path program 1 times [2023-11-06 20:31:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:13,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410612663] [2023-11-06 20:31:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:31:13,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:13,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410612663] [2023-11-06 20:31:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410612663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:13,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:13,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:31:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717721759] [2023-11-06 20:31:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:13,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:31:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:31:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:31:13,786 INFO L87 Difference]: Start difference. First operand 109 states and 140 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 20:31:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:14,187 INFO L93 Difference]: Finished difference Result 276 states and 350 transitions. [2023-11-06 20:31:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:31:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-11-06 20:31:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:14,197 INFO L225 Difference]: With dead ends: 276 [2023-11-06 20:31:14,198 INFO L226 Difference]: Without dead ends: 173 [2023-11-06 20:31:14,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-06 20:31:14,203 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 163 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:14,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 203 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:31:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-06 20:31:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2023-11-06 20:31:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 119 states have internal predecessors, (149), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-06 20:31:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 207 transitions. [2023-11-06 20:31:14,276 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 207 transitions. Word has length 33 [2023-11-06 20:31:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:14,278 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 207 transitions. [2023-11-06 20:31:14,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 20:31:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 207 transitions. [2023-11-06 20:31:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 20:31:14,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:14,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:14,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:31:14,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:31:14,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1634870092, now seen corresponding path program 1 times [2023-11-06 20:31:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206351431] [2023-11-06 20:31:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:31:14,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:14,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206351431] [2023-11-06 20:31:14,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206351431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:31:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116978629] [2023-11-06 20:31:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:14,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:31:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:31:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:14,380 INFO L87 Difference]: Start difference. First operand 164 states and 207 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 20:31:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:14,487 INFO L93 Difference]: Finished difference Result 472 states and 596 transitions. [2023-11-06 20:31:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:31:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2023-11-06 20:31:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:14,493 INFO L225 Difference]: With dead ends: 472 [2023-11-06 20:31:14,493 INFO L226 Difference]: Without dead ends: 313 [2023-11-06 20:31:14,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:14,496 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 58 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:14,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 137 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:31:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-11-06 20:31:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2023-11-06 20:31:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 223 states have (on average 1.2152466367713004) internal successors, (271), 224 states have internal predecessors, (271), 54 states have call successors, (54), 32 states have call predecessors, (54), 32 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 20:31:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 379 transitions. [2023-11-06 20:31:14,557 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 379 transitions. Word has length 35 [2023-11-06 20:31:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:14,557 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 379 transitions. [2023-11-06 20:31:14,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 20:31:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 379 transitions. [2023-11-06 20:31:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 20:31:14,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:14,567 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:14,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:31:14,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:31:14,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2138329007, now seen corresponding path program 1 times [2023-11-06 20:31:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591655064] [2023-11-06 20:31:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 20:31:14,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591655064] [2023-11-06 20:31:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591655064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:31:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799993001] [2023-11-06 20:31:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:14,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:31:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:14,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:31:14,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:14,648 INFO L87 Difference]: Start difference. First operand 310 states and 379 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 20:31:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:14,738 INFO L93 Difference]: Finished difference Result 568 states and 699 transitions. [2023-11-06 20:31:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:31:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2023-11-06 20:31:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:14,743 INFO L225 Difference]: With dead ends: 568 [2023-11-06 20:31:14,743 INFO L226 Difference]: Without dead ends: 410 [2023-11-06 20:31:14,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:14,746 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:14,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 161 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:31:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-06 20:31:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 346. [2023-11-06 20:31:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 253 states have (on average 1.2134387351778657) internal successors, (307), 254 states have internal predecessors, (307), 57 states have call successors, (57), 35 states have call predecessors, (57), 35 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 20:31:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 421 transitions. [2023-11-06 20:31:14,802 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 421 transitions. Word has length 49 [2023-11-06 20:31:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:14,803 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 421 transitions. [2023-11-06 20:31:14,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 20:31:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 421 transitions. [2023-11-06 20:31:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 20:31:14,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:14,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:14,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:31:14,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:31:14,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1563265358, now seen corresponding path program 1 times [2023-11-06 20:31:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195775229] [2023-11-06 20:31:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 20:31:14,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195775229] [2023-11-06 20:31:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195775229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:31:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318657864] [2023-11-06 20:31:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:14,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:31:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:31:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:31:14,895 INFO L87 Difference]: Start difference. First operand 346 states and 421 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 20:31:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:15,093 INFO L93 Difference]: Finished difference Result 540 states and 667 transitions. [2023-11-06 20:31:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:31:15,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2023-11-06 20:31:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:15,097 INFO L225 Difference]: With dead ends: 540 [2023-11-06 20:31:15,098 INFO L226 Difference]: Without dead ends: 346 [2023-11-06 20:31:15,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:31:15,100 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 129 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:15,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 182 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-06 20:31:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2023-11-06 20:31:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 249 states have (on average 1.176706827309237) internal successors, (293), 250 states have internal predecessors, (293), 57 states have call successors, (57), 35 states have call predecessors, (57), 35 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2023-11-06 20:31:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 407 transitions. [2023-11-06 20:31:15,156 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 407 transitions. Word has length 63 [2023-11-06 20:31:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:15,157 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 407 transitions. [2023-11-06 20:31:15,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 20:31:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 407 transitions. [2023-11-06 20:31:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 20:31:15,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:15,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:15,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:31:15,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:31:15,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1452377203, now seen corresponding path program 1 times [2023-11-06 20:31:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:15,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496451800] [2023-11-06 20:31:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:31:15,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 20:31:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:31:15,232 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 20:31:15,233 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 20:31:15,234 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 20:31:15,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 20:31:15,240 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 20:31:15,247 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:31:15,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:31:15 BoogieIcfgContainer [2023-11-06 20:31:15,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:31:15,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:31:15,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:31:15,326 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:31:15,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:12" (3/4) ... [2023-11-06 20:31:15,328 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 20:31:15,409 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/witness.graphml.graphml [2023-11-06 20:31:15,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:31:15,410 INFO L158 Benchmark]: Toolchain (without parser) took 4234.29ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 89.4MB in the beginning and 110.9MB in the end (delta: -21.5MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2023-11-06 20:31:15,411 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 136.3MB. Free memory was 104.5MB in the beginning and 104.4MB in the end (delta: 81.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:31:15,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.92ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 76.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 20:31:15,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.26ms. Allocated memory is still 136.3MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:15,412 INFO L158 Benchmark]: Boogie Preprocessor took 31.30ms. Allocated memory is still 136.3MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:15,412 INFO L158 Benchmark]: RCFGBuilder took 757.32ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 72.9MB in the beginning and 155.3MB in the end (delta: -82.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2023-11-06 20:31:15,413 INFO L158 Benchmark]: TraceAbstraction took 2874.81ms. Allocated memory is still 188.7MB. Free memory was 154.4MB in the beginning and 116.1MB in the end (delta: 38.3MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:15,413 INFO L158 Benchmark]: Witness Printer took 83.83ms. Allocated memory is still 188.7MB. Free memory was 116.1MB in the beginning and 110.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 20:31:15,415 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.36ms. Allocated memory is still 136.3MB. Free memory was 104.5MB in the beginning and 104.4MB in the end (delta: 81.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.92ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 76.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.26ms. Allocated memory is still 136.3MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.30ms. Allocated memory is still 136.3MB. Free memory was 74.3MB in the beginning and 72.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.32ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 72.9MB in the beginning and 155.3MB in the end (delta: -82.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2874.81ms. Allocated memory is still 188.7MB. Free memory was 154.4MB in the beginning and 116.1MB in the end (delta: 38.3MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 83.83ms. Allocated memory is still 188.7MB. Free memory was 116.1MB in the beginning and 110.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) [L255] COND FALSE !(T1_E == 0) [L260] COND FALSE !(E_1 == 0) [L399] RET fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) [L400] RET activate_threads() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) [L278] COND FALSE !(T1_E == 1) [L283] COND FALSE !(E_1 == 1) [L401] RET reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 [L192] return (__retres1); [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L211-L222] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE, EXPR \read(tmp_ndt_2) [L230] EXPR t1_st = 1 [L231] CALL, EXPR transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 [L95] t1_pc = 1 [L96] t1_st = 2 [L231] RET, EXPR transmit1() [L225-L236] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 [L192] return (__retres1); [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE, EXPR \read(tmp_ndt_1) [L216] EXPR m_st = 1 [L217] CALL, EXPR master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 [L322] RET activate_threads() VAL [E_1=1, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET, EXPR master() [L211-L222] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 865 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 386 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 479 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 32/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 20:31:15,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2613c24d-f8ae-4e76-9ba8-f8d4e063f456/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE