./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.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_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/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_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/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_9063e0f6-5794-45e4-abe6-d27f811490d6/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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:28:49,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:28:49,846 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:28:49,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:28:49,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:28:49,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:28:49,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:28:49,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:28:49,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:28:49,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:28:49,916 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:28:49,917 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:28:49,918 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:28:49,919 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:28:49,920 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:28:49,920 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:28:49,921 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:28:49,921 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:28:49,922 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:28:49,922 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:28:49,923 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:28:49,924 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:28:49,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:28:49,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:28:49,926 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:28:49,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:28:49,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:28:49,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:28:49,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:28:49,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:28:49,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:28:49,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:28:49,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:28:49,930 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:28:49,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:28:49,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:28:49,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:28:49,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:28:49,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:28:49,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:28:49,931 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:28:49,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:28:49,932 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:28:49,932 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:28:49,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:28:49,933 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_9063e0f6-5794-45e4-abe6-d27f811490d6/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_9063e0f6-5794-45e4-abe6-d27f811490d6/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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2023-11-06 20:28:50,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:28:50,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:28:50,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:28:50,344 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:28:50,345 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:28:50,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-11-06 20:28:53,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:28:53,796 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:28:53,796 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-11-06 20:28:53,807 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/data/a0217fa11/5961a6cbde0f45e9a318f90387a5b357/FLAGb397268c0 [2023-11-06 20:28:53,823 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/data/a0217fa11/5961a6cbde0f45e9a318f90387a5b357 [2023-11-06 20:28:53,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:28:53,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:28:53,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:28:53,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:28:53,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:28:53,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:28:53" (1/1) ... [2023-11-06 20:28:53,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@285c1418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:53, skipping insertion in model container [2023-11-06 20:28:53,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:28:53" (1/1) ... [2023-11-06 20:28:53,886 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:28:54,066 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_9063e0f6-5794-45e4-abe6-d27f811490d6/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-11-06 20:28:54,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:28:54,133 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:28:54,145 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_9063e0f6-5794-45e4-abe6-d27f811490d6/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-11-06 20:28:54,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:28:54,202 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:28:54,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54 WrapperNode [2023-11-06 20:28:54,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:28:54,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:28:54,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:28:54,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:28:54,212 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:28:54" (1/1) ... [2023-11-06 20:28:54,238 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:28:54" (1/1) ... [2023-11-06 20:28:54,291 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 269 [2023-11-06 20:28:54,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:28:54,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:28:54,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:28:54,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:28:54,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:28:54,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:28:54,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:28:54,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:28:54,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (1/1) ... [2023-11-06 20:28:54,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:28:54,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:28:54,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/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:28:54,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/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:28:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:28:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-06 20:28:54,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-06 20:28:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-06 20:28:54,443 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-06 20:28:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-06 20:28:54,445 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-06 20:28:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 20:28:54,446 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 20:28:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-06 20:28:54,447 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-06 20:28:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:28:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-06 20:28:54,448 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-06 20:28:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:28:54,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:28:54,558 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:28:54,561 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:28:55,026 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:28:55,228 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:28:55,228 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 20:28:55,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:28:55 BoogieIcfgContainer [2023-11-06 20:28:55,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:28:55,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:28:55,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:28:55,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:28:55,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:28:53" (1/3) ... [2023-11-06 20:28:55,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5c0f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:28:55, skipping insertion in model container [2023-11-06 20:28:55,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:54" (2/3) ... [2023-11-06 20:28:55,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5c0f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:28:55, skipping insertion in model container [2023-11-06 20:28:55,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:28:55" (3/3) ... [2023-11-06 20:28:55,242 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2023-11-06 20:28:55,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:28:55,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 20:28:55,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:28:55,325 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;@457197f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:28:55,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 20:28:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 58 states have internal predecessors, (82), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 20:28:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 20:28:55,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:55,339 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, 1, 1] [2023-11-06 20:28:55,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:28:55,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 87965025, now seen corresponding path program 1 times [2023-11-06 20:28:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519986947] [2023-11-06 20:28:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:55,788 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:28:55,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:55,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519986947] [2023-11-06 20:28:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519986947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:55,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:55,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:28:55,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202108790] [2023-11-06 20:28:55,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:55,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:28:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:55,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:28:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:28:55,846 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 58 states have internal predecessors, (82), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:28:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:56,232 INFO L93 Difference]: Finished difference Result 220 states and 318 transitions. [2023-11-06 20:28:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:28:56,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 37 [2023-11-06 20:28:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:56,251 INFO L225 Difference]: With dead ends: 220 [2023-11-06 20:28:56,251 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 20:28:56,256 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:28:56,260 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 175 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:56,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 250 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:28:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 20:28:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2023-11-06 20:28:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 102 states have internal predecessors, (134), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 20:28:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2023-11-06 20:28:56,331 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 37 [2023-11-06 20:28:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:56,332 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2023-11-06 20:28:56,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:28:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2023-11-06 20:28:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 20:28:56,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:56,336 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, 1, 1] [2023-11-06 20:28:56,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:28:56,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:28:56,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:56,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1584552606, now seen corresponding path program 1 times [2023-11-06 20:28:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:56,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416768848] [2023-11-06 20:28:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:56,480 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:28:56,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:56,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416768848] [2023-11-06 20:28:56,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416768848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:56,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:56,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:28:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806865451] [2023-11-06 20:28:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:28:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:28:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:28:56,485 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:28:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:56,969 INFO L93 Difference]: Finished difference Result 462 states and 615 transitions. [2023-11-06 20:28:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:28:56,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 37 [2023-11-06 20:28:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:56,974 INFO L225 Difference]: With dead ends: 462 [2023-11-06 20:28:56,974 INFO L226 Difference]: Without dead ends: 312 [2023-11-06 20:28:56,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:28:56,978 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 317 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:56,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 373 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 20:28:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-06 20:28:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 302. [2023-11-06 20:28:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.3094170403587444) internal successors, (292), 222 states have internal predecessors, (292), 50 states have call successors, (50), 26 states have call predecessors, (50), 28 states have return successors, (54), 54 states have call predecessors, (54), 50 states have call successors, (54) [2023-11-06 20:28:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 396 transitions. [2023-11-06 20:28:57,039 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 396 transitions. Word has length 37 [2023-11-06 20:28:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:57,040 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 396 transitions. [2023-11-06 20:28:57,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:28:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 396 transitions. [2023-11-06 20:28:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 20:28:57,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:57,044 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 20:28:57,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:28:57,044 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:28:57,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1645142024, now seen corresponding path program 1 times [2023-11-06 20:28:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272749561] [2023-11-06 20:28:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 20:28:57,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272749561] [2023-11-06 20:28:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272749561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:57,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:57,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:28:57,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226028243] [2023-11-06 20:28:57,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:57,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:28:57,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:57,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:28:57,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:28:57,290 INFO L87 Difference]: Start difference. First operand 302 states and 396 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 20:28:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:57,661 INFO L93 Difference]: Finished difference Result 818 states and 1069 transitions. [2023-11-06 20:28:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:28:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2023-11-06 20:28:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:57,669 INFO L225 Difference]: With dead ends: 818 [2023-11-06 20:28:57,670 INFO L226 Difference]: Without dead ends: 522 [2023-11-06 20:28:57,672 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:28:57,673 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 235 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:57,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 208 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:28:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-06 20:28:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 489. [2023-11-06 20:28:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 364 states have (on average 1.2967032967032968) internal successors, (472), 361 states have internal predecessors, (472), 76 states have call successors, (76), 44 states have call predecessors, (76), 48 states have return successors, (84), 84 states have call predecessors, (84), 76 states have call successors, (84) [2023-11-06 20:28:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 632 transitions. [2023-11-06 20:28:57,800 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 632 transitions. Word has length 50 [2023-11-06 20:28:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:57,801 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 632 transitions. [2023-11-06 20:28:57,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 20:28:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 632 transitions. [2023-11-06 20:28:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 20:28:57,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:57,805 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 20:28:57,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:28:57,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:28:57,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1647289096, now seen corresponding path program 1 times [2023-11-06 20:28:57,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449487963] [2023-11-06 20:28:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:28:58,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449487963] [2023-11-06 20:28:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449487963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:58,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:28:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689306869] [2023-11-06 20:28:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:58,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:28:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:58,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:28:58,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:28:58,018 INFO L87 Difference]: Start difference. First operand 489 states and 632 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 20:28:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:58,432 INFO L93 Difference]: Finished difference Result 1467 states and 1886 transitions. [2023-11-06 20:28:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:28:58,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2023-11-06 20:28:58,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:58,441 INFO L225 Difference]: With dead ends: 1467 [2023-11-06 20:28:58,441 INFO L226 Difference]: Without dead ends: 984 [2023-11-06 20:28:58,443 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:28:58,445 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 235 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:58,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 201 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:28:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2023-11-06 20:28:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 902. [2023-11-06 20:28:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 677 states have (on average 1.2747415066469718) internal successors, (863), 672 states have internal predecessors, (863), 136 states have call successors, (136), 82 states have call predecessors, (136), 88 states have return successors, (148), 148 states have call predecessors, (148), 136 states have call successors, (148) [2023-11-06 20:28:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1147 transitions. [2023-11-06 20:28:58,607 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1147 transitions. Word has length 54 [2023-11-06 20:28:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:58,608 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 1147 transitions. [2023-11-06 20:28:58,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 20:28:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1147 transitions. [2023-11-06 20:28:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 20:28:58,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:58,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:28:58,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:28:58,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:28:58,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1635251976, now seen corresponding path program 1 times [2023-11-06 20:28:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435530263] [2023-11-06 20:28:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 20:28:58,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435530263] [2023-11-06 20:28:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435530263] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:28:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525277081] [2023-11-06 20:28:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:58,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:28:58,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:28:58,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:28:58,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:28:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:58,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 20:28:58,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:28:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:28:58,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:28:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525277081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:58,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:28:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 20:28:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421656057] [2023-11-06 20:28:58,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:58,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:28:58,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:28:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:28:58,888 INFO L87 Difference]: Start difference. First operand 902 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 20:28:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:59,102 INFO L93 Difference]: Finished difference Result 1685 states and 2158 transitions. [2023-11-06 20:28:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:28:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2023-11-06 20:28:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:59,112 INFO L225 Difference]: With dead ends: 1685 [2023-11-06 20:28:59,112 INFO L226 Difference]: Without dead ends: 1162 [2023-11-06 20:28:59,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:28:59,115 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:59,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 223 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:28:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-11-06 20:28:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 988. [2023-11-06 20:28:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 751 states have (on average 1.2689747003994674) internal successors, (953), 746 states have internal predecessors, (953), 142 states have call successors, (142), 88 states have call predecessors, (142), 94 states have return successors, (154), 154 states have call predecessors, (154), 142 states have call successors, (154) [2023-11-06 20:28:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1249 transitions. [2023-11-06 20:28:59,251 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1249 transitions. Word has length 58 [2023-11-06 20:28:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:59,252 INFO L495 AbstractCegarLoop]: Abstraction has 988 states and 1249 transitions. [2023-11-06 20:28:59,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 20:28:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1249 transitions. [2023-11-06 20:28:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 20:28:59,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:59,255 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:28:59,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:28:59,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:28:59,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:28:59,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash -784461787, now seen corresponding path program 1 times [2023-11-06 20:28:59,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029801487] [2023-11-06 20:28:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:28:59,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029801487] [2023-11-06 20:28:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029801487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:59,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:59,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:28:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353264147] [2023-11-06 20:28:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:59,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:28:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:59,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:28:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:28:59,561 INFO L87 Difference]: Start difference. First operand 988 states and 1249 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 20:28:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:59,752 INFO L93 Difference]: Finished difference Result 1705 states and 2174 transitions. [2023-11-06 20:28:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:28:59,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2023-11-06 20:28:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:59,762 INFO L225 Difference]: With dead ends: 1705 [2023-11-06 20:28:59,762 INFO L226 Difference]: Without dead ends: 1084 [2023-11-06 20:28:59,764 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:28:59,769 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 71 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:59,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 170 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:28:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-11-06 20:28:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 862. [2023-11-06 20:28:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 655 states have (on average 1.2687022900763358) internal successors, (831), 656 states have internal predecessors, (831), 126 states have call successors, (126), 80 states have call predecessors, (126), 80 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2023-11-06 20:28:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1083 transitions. [2023-11-06 20:28:59,876 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1083 transitions. Word has length 61 [2023-11-06 20:28:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:59,878 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1083 transitions. [2023-11-06 20:28:59,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 20:28:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1083 transitions. [2023-11-06 20:28:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 20:28:59,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:59,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-11-06 20:28:59,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 20:28:59,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:28:59,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash 885492564, now seen corresponding path program 1 times [2023-11-06 20:28:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49958076] [2023-11-06 20:28:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:28:59,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:59,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49958076] [2023-11-06 20:28:59,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49958076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:59,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:59,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:28:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238510514] [2023-11-06 20:28:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:59,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:28:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:59,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:28:59,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:28:59,955 INFO L87 Difference]: Start difference. First operand 862 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 20:29:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:00,226 INFO L93 Difference]: Finished difference Result 2134 states and 2687 transitions. [2023-11-06 20:29:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:29:00,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 77 [2023-11-06 20:29:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:00,235 INFO L225 Difference]: With dead ends: 2134 [2023-11-06 20:29:00,236 INFO L226 Difference]: Without dead ends: 1277 [2023-11-06 20:29:00,238 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:29:00,239 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:00,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 175 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2023-11-06 20:29:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1266. [2023-11-06 20:29:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 967 states have (on average 1.2471561530506723) internal successors, (1206), 968 states have internal predecessors, (1206), 181 states have call successors, (181), 117 states have call predecessors, (181), 117 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2023-11-06 20:29:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1568 transitions. [2023-11-06 20:29:00,420 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1568 transitions. Word has length 77 [2023-11-06 20:29:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:00,421 INFO L495 AbstractCegarLoop]: Abstraction has 1266 states and 1568 transitions. [2023-11-06 20:29:00,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 20:29:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1568 transitions. [2023-11-06 20:29:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 20:29:00,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:00,435 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:00,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 20:29:00,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:00,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1368004488, now seen corresponding path program 1 times [2023-11-06 20:29:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990798395] [2023-11-06 20:29:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 20:29:00,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990798395] [2023-11-06 20:29:00,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990798395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:00,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:00,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:29:00,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429348949] [2023-11-06 20:29:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:00,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:29:00,496 INFO L87 Difference]: Start difference. First operand 1266 states and 1568 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 20:29:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:00,819 INFO L93 Difference]: Finished difference Result 2130 states and 2692 transitions. [2023-11-06 20:29:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:29:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2023-11-06 20:29:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:00,828 INFO L225 Difference]: With dead ends: 2130 [2023-11-06 20:29:00,828 INFO L226 Difference]: Without dead ends: 1274 [2023-11-06 20:29:00,831 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:29:00,833 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 160 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:00,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 246 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:29:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2023-11-06 20:29:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1260. [2023-11-06 20:29:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 961 states have (on average 1.2133194588969822) internal successors, (1166), 962 states have internal predecessors, (1166), 181 states have call successors, (181), 117 states have call predecessors, (181), 117 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2023-11-06 20:29:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1528 transitions. [2023-11-06 20:29:01,021 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1528 transitions. Word has length 78 [2023-11-06 20:29:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:01,021 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1528 transitions. [2023-11-06 20:29:01,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 20:29:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1528 transitions. [2023-11-06 20:29:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 20:29:01,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:01,025 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:01,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 20:29:01,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:01,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1935798135, now seen corresponding path program 1 times [2023-11-06 20:29:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169744441] [2023-11-06 20:29:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 20:29:01,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169744441] [2023-11-06 20:29:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169744441] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713432220] [2023-11-06 20:29:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:01,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:01,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:01,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:01,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:29:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:01,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:29:01,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 20:29:01,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:29:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713432220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:01,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:29:01,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-06 20:29:01,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369250939] [2023-11-06 20:29:01,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:01,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:01,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:01,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:29:01,386 INFO L87 Difference]: Start difference. First operand 1260 states and 1528 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 20:29:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:01,759 INFO L93 Difference]: Finished difference Result 2535 states and 3075 transitions. [2023-11-06 20:29:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:29:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2023-11-06 20:29:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:01,771 INFO L225 Difference]: With dead ends: 2535 [2023-11-06 20:29:01,771 INFO L226 Difference]: Without dead ends: 1691 [2023-11-06 20:29:01,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:29:01,775 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 77 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:01,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 323 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2023-11-06 20:29:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1587. [2023-11-06 20:29:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1189 states have (on average 1.2026913372582002) internal successors, (1430), 1192 states have internal predecessors, (1430), 241 states have call successors, (241), 156 states have call predecessors, (241), 156 states have return successors, (263), 239 states have call predecessors, (263), 241 states have call successors, (263) [2023-11-06 20:29:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1934 transitions. [2023-11-06 20:29:02,036 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1934 transitions. Word has length 78 [2023-11-06 20:29:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:02,036 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 1934 transitions. [2023-11-06 20:29:02,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 20:29:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1934 transitions. [2023-11-06 20:29:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 20:29:02,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:02,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:02,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:02,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:02,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:02,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:02,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1658233912, now seen corresponding path program 1 times [2023-11-06 20:29:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:02,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624376760] [2023-11-06 20:29:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 20:29:02,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:02,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624376760] [2023-11-06 20:29:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624376760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:02,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:02,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:29:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454312554] [2023-11-06 20:29:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:02,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:29:02,356 INFO L87 Difference]: Start difference. First operand 1587 states and 1934 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 20:29:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:02,791 INFO L93 Difference]: Finished difference Result 2938 states and 3617 transitions. [2023-11-06 20:29:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:29:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2023-11-06 20:29:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:02,805 INFO L225 Difference]: With dead ends: 2938 [2023-11-06 20:29:02,806 INFO L226 Difference]: Without dead ends: 2080 [2023-11-06 20:29:02,809 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:29:02,810 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 88 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:02,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 213 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2023-11-06 20:29:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2005. [2023-11-06 20:29:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1573 states have (on average 1.1900826446280992) internal successors, (1872), 1579 states have internal predecessors, (1872), 241 states have call successors, (241), 187 states have call predecessors, (241), 190 states have return successors, (284), 239 states have call predecessors, (284), 241 states have call successors, (284) [2023-11-06 20:29:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2397 transitions. [2023-11-06 20:29:03,142 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2397 transitions. Word has length 78 [2023-11-06 20:29:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:03,143 INFO L495 AbstractCegarLoop]: Abstraction has 2005 states and 2397 transitions. [2023-11-06 20:29:03,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 20:29:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2397 transitions. [2023-11-06 20:29:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 20:29:03,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:03,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-06 20:29:03,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 20:29:03,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:03,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash -517882201, now seen corresponding path program 1 times [2023-11-06 20:29:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:03,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824193053] [2023-11-06 20:29:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 20:29:03,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824193053] [2023-11-06 20:29:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824193053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:03,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:29:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668262652] [2023-11-06 20:29:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:03,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:29:03,205 INFO L87 Difference]: Start difference. First operand 2005 states and 2397 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 20:29:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:03,653 INFO L93 Difference]: Finished difference Result 3053 states and 3740 transitions. [2023-11-06 20:29:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:29:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2023-11-06 20:29:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:03,668 INFO L225 Difference]: With dead ends: 3053 [2023-11-06 20:29:03,668 INFO L226 Difference]: Without dead ends: 1975 [2023-11-06 20:29:03,672 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:29:03,673 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 169 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:03,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 246 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:29:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2023-11-06 20:29:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1959. [2023-11-06 20:29:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1533 states have (on average 1.1611219830397912) internal successors, (1780), 1533 states have internal predecessors, (1780), 241 states have call successors, (241), 187 states have call predecessors, (241), 184 states have return successors, (275), 239 states have call predecessors, (275), 241 states have call successors, (275) [2023-11-06 20:29:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2296 transitions. [2023-11-06 20:29:03,981 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2296 transitions. Word has length 78 [2023-11-06 20:29:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:03,981 INFO L495 AbstractCegarLoop]: Abstraction has 1959 states and 2296 transitions. [2023-11-06 20:29:03,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 20:29:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2296 transitions. [2023-11-06 20:29:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 20:29:03,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:03,986 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:03,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 20:29:03,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:03,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1507284094, now seen corresponding path program 1 times [2023-11-06 20:29:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:03,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45317801] [2023-11-06 20:29:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:29:04,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45317801] [2023-11-06 20:29:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45317801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:29:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731764620] [2023-11-06 20:29:04,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:04,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:29:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:29:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:29:04,053 INFO L87 Difference]: Start difference. First operand 1959 states and 2296 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 20:29:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:04,509 INFO L93 Difference]: Finished difference Result 3659 states and 4330 transitions. [2023-11-06 20:29:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:29:04,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2023-11-06 20:29:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:04,527 INFO L225 Difference]: With dead ends: 3659 [2023-11-06 20:29:04,528 INFO L226 Difference]: Without dead ends: 2230 [2023-11-06 20:29:04,533 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:29:04,534 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 39 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:04,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 207 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2023-11-06 20:29:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2088. [2023-11-06 20:29:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 1644 states have (on average 1.1684914841849148) internal successors, (1921), 1644 states have internal predecessors, (1921), 250 states have call successors, (250), 196 states have call predecessors, (250), 193 states have return successors, (284), 248 states have call predecessors, (284), 250 states have call successors, (284) [2023-11-06 20:29:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2455 transitions. [2023-11-06 20:29:04,892 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2455 transitions. Word has length 79 [2023-11-06 20:29:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:04,892 INFO L495 AbstractCegarLoop]: Abstraction has 2088 states and 2455 transitions. [2023-11-06 20:29:04,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 20:29:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2455 transitions. [2023-11-06 20:29:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 20:29:04,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:04,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:04,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 20:29:04,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:04,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash 651072430, now seen corresponding path program 1 times [2023-11-06 20:29:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:04,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046054779] [2023-11-06 20:29:04,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 20:29:05,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046054779] [2023-11-06 20:29:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046054779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:05,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:05,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:29:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839019262] [2023-11-06 20:29:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:05,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:29:05,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:05,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:29:05,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:29:05,109 INFO L87 Difference]: Start difference. First operand 2088 states and 2455 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 20:29:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:05,741 INFO L93 Difference]: Finished difference Result 3893 states and 4622 transitions. [2023-11-06 20:29:05,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:29:05,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2023-11-06 20:29:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:05,759 INFO L225 Difference]: With dead ends: 3893 [2023-11-06 20:29:05,759 INFO L226 Difference]: Without dead ends: 2966 [2023-11-06 20:29:05,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:29:05,764 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:05,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 357 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:29:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2023-11-06 20:29:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2856. [2023-11-06 20:29:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2240 states have (on average 1.1647321428571429) internal successors, (2609), 2229 states have internal predecessors, (2609), 354 states have call successors, (354), 276 states have call predecessors, (354), 261 states have return successors, (411), 351 states have call predecessors, (411), 354 states have call successors, (411) [2023-11-06 20:29:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3374 transitions. [2023-11-06 20:29:06,211 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3374 transitions. Word has length 79 [2023-11-06 20:29:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:06,212 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 3374 transitions. [2023-11-06 20:29:06,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 20:29:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3374 transitions. [2023-11-06 20:29:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 20:29:06,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:06,218 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 20:29:06,218 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:06,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash -530097280, now seen corresponding path program 1 times [2023-11-06 20:29:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419463093] [2023-11-06 20:29:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 20:29:06,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419463093] [2023-11-06 20:29:06,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419463093] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951392619] [2023-11-06 20:29:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:06,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:06,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:06,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:29:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:06,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 20:29:06,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 20:29:06,890 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:29:06,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951392619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:06,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:29:06,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2023-11-06 20:29:06,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122584576] [2023-11-06 20:29:06,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:06,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:29:06,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:06,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:29:06,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 20:29:06,893 INFO L87 Difference]: Start difference. First operand 2856 states and 3374 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-06 20:29:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:07,545 INFO L93 Difference]: Finished difference Result 4607 states and 5487 transitions. [2023-11-06 20:29:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 20:29:07,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 99 [2023-11-06 20:29:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:07,558 INFO L225 Difference]: With dead ends: 4607 [2023-11-06 20:29:07,558 INFO L226 Difference]: Without dead ends: 1807 [2023-11-06 20:29:07,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-11-06 20:29:07,566 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 163 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:07,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 815 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:29:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2023-11-06 20:29:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1369. [2023-11-06 20:29:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1100 states have (on average 1.170909090909091) internal successors, (1288), 1096 states have internal predecessors, (1288), 149 states have call successors, (149), 120 states have call predecessors, (149), 119 states have return successors, (170), 153 states have call predecessors, (170), 149 states have call successors, (170) [2023-11-06 20:29:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1607 transitions. [2023-11-06 20:29:07,779 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1607 transitions. Word has length 99 [2023-11-06 20:29:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:07,779 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 1607 transitions. [2023-11-06 20:29:07,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-06 20:29:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1607 transitions. [2023-11-06 20:29:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 20:29:07,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:07,783 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:07,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:07,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 20:29:07,990 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:07,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:07,991 INFO L85 PathProgramCache]: Analyzing trace with hash 987347346, now seen corresponding path program 1 times [2023-11-06 20:29:07,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:07,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887441881] [2023-11-06 20:29:07,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 20:29:08,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887441881] [2023-11-06 20:29:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887441881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:08,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:08,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:29:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907664558] [2023-11-06 20:29:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:08,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:08,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:29:08,077 INFO L87 Difference]: Start difference. First operand 1369 states and 1607 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 20:29:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:08,336 INFO L93 Difference]: Finished difference Result 2080 states and 2475 transitions. [2023-11-06 20:29:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:29:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2023-11-06 20:29:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:08,344 INFO L225 Difference]: With dead ends: 2080 [2023-11-06 20:29:08,344 INFO L226 Difference]: Without dead ends: 1185 [2023-11-06 20:29:08,348 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:29:08,348 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 99 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:08,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 157 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2023-11-06 20:29:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2023-11-06 20:29:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 961 states have (on average 1.1560874089490114) internal successors, (1111), 958 states have internal predecessors, (1111), 125 states have call successors, (125), 102 states have call predecessors, (125), 98 states have return successors, (131), 125 states have call predecessors, (131), 125 states have call successors, (131) [2023-11-06 20:29:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1367 transitions. [2023-11-06 20:29:08,518 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1367 transitions. Word has length 100 [2023-11-06 20:29:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:08,518 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1367 transitions. [2023-11-06 20:29:08,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 20:29:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1367 transitions. [2023-11-06 20:29:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 20:29:08,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:08,522 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:08,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 20:29:08,523 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:08,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 659184417, now seen corresponding path program 1 times [2023-11-06 20:29:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341746268] [2023-11-06 20:29:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 20:29:08,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341746268] [2023-11-06 20:29:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341746268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953691221] [2023-11-06 20:29:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:08,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:08,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:08,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:29:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:08,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 20:29:08,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 20:29:08,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:29:08,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953691221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:08,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:29:08,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-06 20:29:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271204099] [2023-11-06 20:29:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:08,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:08,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:08,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:29:08,997 INFO L87 Difference]: Start difference. First operand 1185 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 20:29:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:09,399 INFO L93 Difference]: Finished difference Result 2512 states and 2916 transitions. [2023-11-06 20:29:09,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:29:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2023-11-06 20:29:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:09,411 INFO L225 Difference]: With dead ends: 2512 [2023-11-06 20:29:09,411 INFO L226 Difference]: Without dead ends: 1801 [2023-11-06 20:29:09,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:29:09,414 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 97 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:09,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 226 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2023-11-06 20:29:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1321. [2023-11-06 20:29:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1080 states have (on average 1.1583333333333334) internal successors, (1251), 1079 states have internal predecessors, (1251), 133 states have call successors, (133), 110 states have call predecessors, (133), 107 states have return successors, (141), 132 states have call predecessors, (141), 133 states have call successors, (141) [2023-11-06 20:29:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1525 transitions. [2023-11-06 20:29:09,618 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1525 transitions. Word has length 101 [2023-11-06 20:29:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:09,619 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1525 transitions. [2023-11-06 20:29:09,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 20:29:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1525 transitions. [2023-11-06 20:29:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 20:29:09,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:09,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:09,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:09,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 20:29:09,833 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:09,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:09,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1177256421, now seen corresponding path program 1 times [2023-11-06 20:29:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:09,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606776250] [2023-11-06 20:29:09,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:09,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:29:09,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 20:29:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:29:09,939 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 20:29:09,940 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 20:29:09,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 20:29:09,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 20:29:09,947 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:09,951 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:29:10,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:29:10 BoogieIcfgContainer [2023-11-06 20:29:10,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:29:10,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:29:10,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:29:10,065 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:29:10,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:28:55" (3/4) ... [2023-11-06 20:29:10,067 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 20:29:10,153 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/bin/utaipan-verify-FOvIYxoinp/witness.graphml.graphml [2023-11-06 20:29:10,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:29:10,154 INFO L158 Benchmark]: Toolchain (without parser) took 16326.96ms. Allocated memory was 132.1MB in the beginning and 562.0MB in the end (delta: 429.9MB). Free memory was 95.5MB in the beginning and 353.4MB in the end (delta: -257.8MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. [2023-11-06 20:29:10,155 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 132.1MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:29:10,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.93ms. Allocated memory is still 132.1MB. Free memory was 95.2MB in the beginning and 81.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 20:29:10,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.76ms. Allocated memory is still 132.1MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:29:10,156 INFO L158 Benchmark]: Boogie Preprocessor took 64.20ms. Allocated memory is still 132.1MB. Free memory was 79.6MB in the beginning and 77.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:29:10,156 INFO L158 Benchmark]: RCFGBuilder took 872.64ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 77.7MB in the beginning and 145.4MB in the end (delta: -67.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-06 20:29:10,157 INFO L158 Benchmark]: TraceAbstraction took 14829.88ms. Allocated memory was 178.3MB in the beginning and 562.0MB in the end (delta: 383.8MB). Free memory was 145.4MB in the beginning and 362.9MB in the end (delta: -217.5MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2023-11-06 20:29:10,157 INFO L158 Benchmark]: Witness Printer took 88.75ms. Allocated memory is still 562.0MB. Free memory was 362.9MB in the beginning and 353.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 20:29:10,159 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.34ms. Allocated memory is still 132.1MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.93ms. Allocated memory is still 132.1MB. Free memory was 95.2MB in the beginning and 81.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.76ms. Allocated memory is still 132.1MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.20ms. Allocated memory is still 132.1MB. Free memory was 79.6MB in the beginning and 77.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 872.64ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 77.7MB in the beginning and 145.4MB in the end (delta: -67.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14829.88ms. Allocated memory was 178.3MB in the beginning and 562.0MB in the end (delta: 383.8MB). Free memory was 145.4MB in the beginning and 362.9MB in the end (delta: -217.5MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. * Witness Printer took 88.75ms. Allocated memory is still 562.0MB. Free memory was 362.9MB in the beginning and 353.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. 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 t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) [L339] COND FALSE !(T1_E == 0) [L344] COND FALSE !(T2_E == 0) [L349] COND FALSE !(E_1 == 0) [L354] COND FALSE !(E_2 == 0) [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) [L372] COND FALSE !(T1_E == 1) [L377] COND FALSE !(T2_E == 1) [L382] COND FALSE !(E_1 == 1) [L387] COND FALSE !(E_2 == 1) [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L281-L292] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE, EXPR \read(tmp_ndt_2) [L300] EXPR t1_st = 1 [L301] CALL, EXPR transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET, EXPR transmit1() [L295-L306] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE, EXPR \read(tmp_ndt_3) [L314] EXPR t2_st = 1 [L315] CALL, EXPR transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 [L315] RET, EXPR transmit2() [L309-L320] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE, EXPR \read(tmp_ndt_1) [L286] EXPR m_st = 1 [L287] CALL, EXPR master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET, EXPR master() [L281-L292] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE, EXPR \read(tmp_ndt_2) [L300] EXPR t1_st = 1 [L301] CALL, EXPR transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET, EXPR transmit1() [L295-L306] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2140 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2111 mSDsluCounter, 4390 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2428 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1856 IncrementalHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 1962 mSDtfsCounter, 1856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2856occurred in iteration=13, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1914 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1582 NumberOfCodeBlocks, 1582 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1460 ConstructedInterpolants, 0 QuantifiedInterpolants, 2828 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1367 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 491/518 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:29:10,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9063e0f6-5794-45e4-abe6-d27f811490d6/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