./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:52:59,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:52:59,100 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:52:59,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:52:59,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:52:59,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:52:59,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:52:59,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:52:59,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:52:59,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:52:59,133 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:52:59,134 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:52:59,134 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:52:59,135 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:52:59,135 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:52:59,136 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:52:59,136 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:52:59,137 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:52:59,137 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:52:59,138 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:52:59,138 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:52:59,139 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:52:59,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:52:59,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:52:59,141 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:52:59,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:52:59,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:52:59,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:52:59,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:52:59,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:52:59,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:52:59,144 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:52:59,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:52:59,144 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:52:59,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:52:59,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:52:59,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:52:59,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:52:59,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:52:59,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:52:59,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:52:59,146 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:52:59,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:52:59,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:52:59,147 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:52:59,147 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:52:59,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:52:59,147 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_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/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_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 [2023-12-02 15:52:59,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:52:59,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:52:59,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:52:59,400 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:52:59,400 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:52:59,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-12-02 15:53:02,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:53:02,447 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:53:02,447 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-12-02 15:53:02,465 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/data/78cc2bf36/ff51b9bda6fa4282a018def0ac2728e6/FLAGabe72b0a6 [2023-12-02 15:53:02,478 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/data/78cc2bf36/ff51b9bda6fa4282a018def0ac2728e6 [2023-12-02 15:53:02,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:53:02,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:53:02,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:53:02,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:53:02,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:53:02,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:53:02" (1/1) ... [2023-12-02 15:53:02,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8cb16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:02, skipping insertion in model container [2023-12-02 15:53:02,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:53:02" (1/1) ... [2023-12-02 15:53:02,548 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:53:02,717 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_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-12-02 15:53:02,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:53:02,930 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:53:02,942 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_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-12-02 15:53:02,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:53:03,070 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:53:03,070 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:53:03,078 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:53:03,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03 WrapperNode [2023-12-02 15:53:03,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:53:03,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:53:03,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:53:03,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:53:03,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,134 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-12-02 15:53:03,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:53:03,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:53:03,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:53:03,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:53:03,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:53:03,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:53:03,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:53:03,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:53:03,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (1/1) ... [2023-12-02 15:53:03,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:53:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:53:03,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:53:03,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:53:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:53:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 15:53:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:53:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:53:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:53:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 15:53:03,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 15:53:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 15:53:03,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 15:53:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 15:53:03,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 15:53:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-02 15:53:03,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-02 15:53:03,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:53:03,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 15:53:03,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:53:03,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:53:03,248 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 15:53:03,384 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:53:03,386 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:53:03,704 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:53:03,889 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:53:03,890 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 15:53:03,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:53:03 BoogieIcfgContainer [2023-12-02 15:53:03,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:53:03,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:53:03,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:53:03,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:53:03,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:53:02" (1/3) ... [2023-12-02 15:53:03,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473dce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:53:03, skipping insertion in model container [2023-12-02 15:53:03,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:53:03" (2/3) ... [2023-12-02 15:53:03,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473dce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:53:03, skipping insertion in model container [2023-12-02 15:53:03,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:53:03" (3/3) ... [2023-12-02 15:53:03,898 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-12-02 15:53:03,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 15:53:03,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:53:03,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 15:53:03,914 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 15:53:03,961 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:53:03,986 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 50 transitions, 116 flow [2023-12-02 15:53:05,347 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35986 states, 35983 states have (on average 4.375399494205597) internal successors, (157440), 35985 states have internal predecessors, (157440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:05,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:53:05,371 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24a29adf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:53:05,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-02 15:53:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 35986 states, 35983 states have (on average 4.375399494205597) internal successors, (157440), 35985 states have internal predecessors, (157440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:53:05,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:05,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:53:05,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:05,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 12425846, now seen corresponding path program 1 times [2023-12-02 15:53:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706933247] [2023-12-02 15:53:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:05,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706933247] [2023-12-02 15:53:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706933247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:05,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:05,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:53:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891959791] [2023-12-02 15:53:05,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:05,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:53:05,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:53:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:53:06,031 INFO L87 Difference]: Start difference. First operand has 35986 states, 35983 states have (on average 4.375399494205597) internal successors, (157440), 35985 states have internal predecessors, (157440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:06,837 INFO L93 Difference]: Finished difference Result 30928 states and 133372 transitions. [2023-12-02 15:53:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:53:06,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 15:53:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:07,207 INFO L225 Difference]: With dead ends: 30928 [2023-12-02 15:53:07,208 INFO L226 Difference]: Without dead ends: 29136 [2023-12-02 15:53:07,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-02 15:53:07,212 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:07,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:53:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29136 states. [2023-12-02 15:53:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29136 to 29136. [2023-12-02 15:53:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29136 states, 29135 states have (on average 4.3251072593101085) internal successors, (126012), 29135 states have internal predecessors, (126012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29136 states to 29136 states and 126012 transitions. [2023-12-02 15:53:08,790 INFO L78 Accepts]: Start accepts. Automaton has 29136 states and 126012 transitions. Word has length 4 [2023-12-02 15:53:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:08,790 INFO L495 AbstractCegarLoop]: Abstraction has 29136 states and 126012 transitions. [2023-12-02 15:53:08,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 29136 states and 126012 transitions. [2023-12-02 15:53:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 15:53:08,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:08,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:53:08,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:53:08,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:08,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1774500198, now seen corresponding path program 1 times [2023-12-02 15:53:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128634148] [2023-12-02 15:53:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:09,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128634148] [2023-12-02 15:53:09,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128634148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:09,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:09,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:53:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507321277] [2023-12-02 15:53:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:09,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:53:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:53:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:53:09,155 INFO L87 Difference]: Start difference. First operand 29136 states and 126012 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:10,550 INFO L93 Difference]: Finished difference Result 54272 states and 228744 transitions. [2023-12-02 15:53:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:53:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 15:53:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:10,838 INFO L225 Difference]: With dead ends: 54272 [2023-12-02 15:53:10,838 INFO L226 Difference]: Without dead ends: 43280 [2023-12-02 15:53:10,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:53:10,840 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 106 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:10,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 166 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:53:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43280 states. [2023-12-02 15:53:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43280 to 36400. [2023-12-02 15:53:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36400 states, 36399 states have (on average 4.271930547542515) internal successors, (155494), 36399 states have internal predecessors, (155494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36400 states to 36400 states and 155494 transitions. [2023-12-02 15:53:12,559 INFO L78 Accepts]: Start accepts. Automaton has 36400 states and 155494 transitions. Word has length 16 [2023-12-02 15:53:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:12,561 INFO L495 AbstractCegarLoop]: Abstraction has 36400 states and 155494 transitions. [2023-12-02 15:53:12,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36400 states and 155494 transitions. [2023-12-02 15:53:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:53:12,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:12,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:53:12,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:53:12,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:12,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1684485349, now seen corresponding path program 1 times [2023-12-02 15:53:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693504366] [2023-12-02 15:53:12,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:12,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:12,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693504366] [2023-12-02 15:53:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693504366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:53:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035003003] [2023-12-02 15:53:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:53:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:53:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:53:12,865 INFO L87 Difference]: Start difference. First operand 36400 states and 155494 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:13,889 INFO L93 Difference]: Finished difference Result 44280 states and 184988 transitions. [2023-12-02 15:53:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 15:53:13,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 15:53:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:14,053 INFO L225 Difference]: With dead ends: 44280 [2023-12-02 15:53:14,053 INFO L226 Difference]: Without dead ends: 36680 [2023-12-02 15:53:14,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:53:14,055 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:14,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 217 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:53:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36680 states. [2023-12-02 15:53:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36680 to 28752. [2023-12-02 15:53:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28752 states, 28751 states have (on average 4.246808806650203) internal successors, (122100), 28751 states have internal predecessors, (122100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28752 states to 28752 states and 122100 transitions. [2023-12-02 15:53:15,157 INFO L78 Accepts]: Start accepts. Automaton has 28752 states and 122100 transitions. Word has length 18 [2023-12-02 15:53:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:15,157 INFO L495 AbstractCegarLoop]: Abstraction has 28752 states and 122100 transitions. [2023-12-02 15:53:15,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28752 states and 122100 transitions. [2023-12-02 15:53:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:53:15,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:15,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:53:15,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:53:15,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:15,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1682403499, now seen corresponding path program 1 times [2023-12-02 15:53:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482096819] [2023-12-02 15:53:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:15,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:15,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482096819] [2023-12-02 15:53:15,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482096819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:15,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:53:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243644843] [2023-12-02 15:53:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:15,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:53:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:53:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:53:15,386 INFO L87 Difference]: Start difference. First operand 28752 states and 122100 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:16,192 INFO L93 Difference]: Finished difference Result 36352 states and 150970 transitions. [2023-12-02 15:53:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 15:53:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 15:53:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:16,331 INFO L225 Difference]: With dead ends: 36352 [2023-12-02 15:53:16,331 INFO L226 Difference]: Without dead ends: 31032 [2023-12-02 15:53:16,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:53:16,333 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 128 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:16,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 203 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:53:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31032 states. [2023-12-02 15:53:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31032 to 23712. [2023-12-02 15:53:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23712 states, 23711 states have (on average 4.217156593985914) internal successors, (99993), 23711 states have internal predecessors, (99993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23712 states to 23712 states and 99993 transitions. [2023-12-02 15:53:17,255 INFO L78 Accepts]: Start accepts. Automaton has 23712 states and 99993 transitions. Word has length 19 [2023-12-02 15:53:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:17,255 INFO L495 AbstractCegarLoop]: Abstraction has 23712 states and 99993 transitions. [2023-12-02 15:53:17,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23712 states and 99993 transitions. [2023-12-02 15:53:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:53:17,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:17,276 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] [2023-12-02 15:53:17,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:53:17,276 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:17,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1335703429, now seen corresponding path program 1 times [2023-12-02 15:53:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792720964] [2023-12-02 15:53:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:17,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792720964] [2023-12-02 15:53:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792720964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:17,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:17,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:53:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906953796] [2023-12-02 15:53:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:53:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:53:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:53:17,403 INFO L87 Difference]: Start difference. First operand 23712 states and 99993 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:17,630 INFO L93 Difference]: Finished difference Result 23470 states and 94158 transitions. [2023-12-02 15:53:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:53:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 15:53:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:17,697 INFO L225 Difference]: With dead ends: 23470 [2023-12-02 15:53:17,697 INFO L226 Difference]: Without dead ends: 19890 [2023-12-02 15:53:17,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:53:17,699 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:17,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 49 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:53:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19890 states. [2023-12-02 15:53:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19890 to 19890. [2023-12-02 15:53:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19890 states, 19889 states have (on average 4.067926994821258) internal successors, (80907), 19889 states have internal predecessors, (80907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19890 states to 19890 states and 80907 transitions. [2023-12-02 15:53:18,318 INFO L78 Accepts]: Start accepts. Automaton has 19890 states and 80907 transitions. Word has length 22 [2023-12-02 15:53:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:18,319 INFO L495 AbstractCegarLoop]: Abstraction has 19890 states and 80907 transitions. [2023-12-02 15:53:18,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 19890 states and 80907 transitions. [2023-12-02 15:53:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:53:18,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:18,342 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] [2023-12-02 15:53:18,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:53:18,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:18,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1931065082, now seen corresponding path program 1 times [2023-12-02 15:53:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079159954] [2023-12-02 15:53:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:18,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079159954] [2023-12-02 15:53:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079159954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:18,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:18,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:53:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190104833] [2023-12-02 15:53:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:18,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:53:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:53:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:53:18,520 INFO L87 Difference]: Start difference. First operand 19890 states and 80907 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:18,759 INFO L93 Difference]: Finished difference Result 16070 states and 61953 transitions. [2023-12-02 15:53:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:53:18,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 15:53:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:18,795 INFO L225 Difference]: With dead ends: 16070 [2023-12-02 15:53:18,795 INFO L226 Difference]: Without dead ends: 13464 [2023-12-02 15:53:18,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:53:18,796 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 150 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:18,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 61 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:53:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13464 states. [2023-12-02 15:53:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13464 to 13440. [2023-12-02 15:53:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13440 states, 13439 states have (on average 3.8663591041000074) internal successors, (51960), 13439 states have internal predecessors, (51960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13440 states to 13440 states and 51960 transitions. [2023-12-02 15:53:19,238 INFO L78 Accepts]: Start accepts. Automaton has 13440 states and 51960 transitions. Word has length 25 [2023-12-02 15:53:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:19,238 INFO L495 AbstractCegarLoop]: Abstraction has 13440 states and 51960 transitions. [2023-12-02 15:53:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 13440 states and 51960 transitions. [2023-12-02 15:53:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:53:19,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:19,258 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] [2023-12-02 15:53:19,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:53:19,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:19,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash 747570686, now seen corresponding path program 1 times [2023-12-02 15:53:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497366551] [2023-12-02 15:53:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:19,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497366551] [2023-12-02 15:53:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497366551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:19,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:53:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490330926] [2023-12-02 15:53:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:19,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:53:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:53:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:53:19,464 INFO L87 Difference]: Start difference. First operand 13440 states and 51960 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:19,734 INFO L93 Difference]: Finished difference Result 10424 states and 39580 transitions. [2023-12-02 15:53:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:53:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 15:53:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:19,771 INFO L225 Difference]: With dead ends: 10424 [2023-12-02 15:53:19,771 INFO L226 Difference]: Without dead ends: 9320 [2023-12-02 15:53:19,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:53:19,772 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 187 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:19,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 79 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:53:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2023-12-02 15:53:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 9096. [2023-12-02 15:53:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9096 states, 9095 states have (on average 3.810445299615173) internal successors, (34656), 9095 states have internal predecessors, (34656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 34656 transitions. [2023-12-02 15:53:20,156 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 34656 transitions. Word has length 28 [2023-12-02 15:53:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:20,156 INFO L495 AbstractCegarLoop]: Abstraction has 9096 states and 34656 transitions. [2023-12-02 15:53:20,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 34656 transitions. [2023-12-02 15:53:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:53:20,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:20,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:53:20,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:53:20,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:20,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash 281768264, now seen corresponding path program 1 times [2023-12-02 15:53:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122939992] [2023-12-02 15:53:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:20,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122939992] [2023-12-02 15:53:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122939992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:20,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:20,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:53:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238865470] [2023-12-02 15:53:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:20,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:53:20,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:53:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:53:20,443 INFO L87 Difference]: Start difference. First operand 9096 states and 34656 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:20,743 INFO L93 Difference]: Finished difference Result 12992 states and 48972 transitions. [2023-12-02 15:53:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:53:20,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-02 15:53:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:20,772 INFO L225 Difference]: With dead ends: 12992 [2023-12-02 15:53:20,772 INFO L226 Difference]: Without dead ends: 8464 [2023-12-02 15:53:20,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:53:20,773 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 60 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:20,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 137 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:53:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states. [2023-12-02 15:53:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 8336. [2023-12-02 15:53:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8336 states, 8335 states have (on average 3.742771445710858) internal successors, (31196), 8335 states have internal predecessors, (31196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8336 states to 8336 states and 31196 transitions. [2023-12-02 15:53:21,008 INFO L78 Accepts]: Start accepts. Automaton has 8336 states and 31196 transitions. Word has length 33 [2023-12-02 15:53:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:21,008 INFO L495 AbstractCegarLoop]: Abstraction has 8336 states and 31196 transitions. [2023-12-02 15:53:21,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8336 states and 31196 transitions. [2023-12-02 15:53:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:53:21,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:21,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:53:21,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 15:53:21,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:21,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1277721826, now seen corresponding path program 2 times [2023-12-02 15:53:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915152064] [2023-12-02 15:53:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:21,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915152064] [2023-12-02 15:53:21,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915152064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:21,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:21,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:53:21,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149351473] [2023-12-02 15:53:21,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:21,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:53:21,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:21,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:53:21,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:53:21,944 INFO L87 Difference]: Start difference. First operand 8336 states and 31196 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:22,562 INFO L93 Difference]: Finished difference Result 14738 states and 54080 transitions. [2023-12-02 15:53:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:53:22,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-02 15:53:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:22,588 INFO L225 Difference]: With dead ends: 14738 [2023-12-02 15:53:22,589 INFO L226 Difference]: Without dead ends: 11682 [2023-12-02 15:53:22,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:53:22,589 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 153 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:22,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 458 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:53:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11682 states. [2023-12-02 15:53:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11682 to 9798. [2023-12-02 15:53:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9798 states, 9797 states have (on average 3.702562008778197) internal successors, (36274), 9797 states have internal predecessors, (36274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 36274 transitions. [2023-12-02 15:53:22,793 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 36274 transitions. Word has length 33 [2023-12-02 15:53:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:22,793 INFO L495 AbstractCegarLoop]: Abstraction has 9798 states and 36274 transitions. [2023-12-02 15:53:22,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 36274 transitions. [2023-12-02 15:53:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:53:22,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:22,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:53:22,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:53:22,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:22,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash 562208572, now seen corresponding path program 3 times [2023-12-02 15:53:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351626080] [2023-12-02 15:53:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:23,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351626080] [2023-12-02 15:53:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351626080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:53:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203909190] [2023-12-02 15:53:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:23,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:53:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:23,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:53:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:53:23,054 INFO L87 Difference]: Start difference. First operand 9798 states and 36274 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:23,302 INFO L93 Difference]: Finished difference Result 8918 states and 33162 transitions. [2023-12-02 15:53:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:53:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-02 15:53:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:23,327 INFO L225 Difference]: With dead ends: 8918 [2023-12-02 15:53:23,328 INFO L226 Difference]: Without dead ends: 6120 [2023-12-02 15:53:23,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:53:23,329 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 238 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:23,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 59 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:53:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2023-12-02 15:53:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6120. [2023-12-02 15:53:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6120 states, 6119 states have (on average 3.691779702565779) internal successors, (22590), 6119 states have internal predecessors, (22590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 22590 transitions. [2023-12-02 15:53:23,491 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 22590 transitions. Word has length 33 [2023-12-02 15:53:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:23,491 INFO L495 AbstractCegarLoop]: Abstraction has 6120 states and 22590 transitions. [2023-12-02 15:53:23,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 22590 transitions. [2023-12-02 15:53:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:53:23,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:23,505 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, 1] [2023-12-02 15:53:23,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 15:53:23,505 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:23,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash -387689948, now seen corresponding path program 1 times [2023-12-02 15:53:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158053627] [2023-12-02 15:53:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:23,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158053627] [2023-12-02 15:53:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158053627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:23,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:53:23,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076252347] [2023-12-02 15:53:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:23,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:53:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:53:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:53:23,835 INFO L87 Difference]: Start difference. First operand 6120 states and 22590 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:24,081 INFO L93 Difference]: Finished difference Result 7820 states and 28686 transitions. [2023-12-02 15:53:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:53:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-02 15:53:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:24,091 INFO L225 Difference]: With dead ends: 7820 [2023-12-02 15:53:24,091 INFO L226 Difference]: Without dead ends: 3390 [2023-12-02 15:53:24,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:53:24,092 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:24,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 151 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:53:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2023-12-02 15:53:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3390. [2023-12-02 15:53:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 3389 states have (on average 3.5491295367365003) internal successors, (12028), 3389 states have internal predecessors, (12028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 12028 transitions. [2023-12-02 15:53:24,175 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 12028 transitions. Word has length 38 [2023-12-02 15:53:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:24,175 INFO L495 AbstractCegarLoop]: Abstraction has 3390 states and 12028 transitions. [2023-12-02 15:53:24,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 12028 transitions. [2023-12-02 15:53:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:53:24,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:24,182 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, 1] [2023-12-02 15:53:24,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 15:53:24,182 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:24,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1414387686, now seen corresponding path program 2 times [2023-12-02 15:53:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:24,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774598797] [2023-12-02 15:53:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:53:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:53:25,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:53:25,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774598797] [2023-12-02 15:53:25,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774598797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:53:25,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:53:25,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:53:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966466937] [2023-12-02 15:53:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:53:25,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 15:53:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:53:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 15:53:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:53:25,368 INFO L87 Difference]: Start difference. First operand 3390 states and 12028 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:53:25,953 INFO L93 Difference]: Finished difference Result 5548 states and 19559 transitions. [2023-12-02 15:53:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:53:25,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-02 15:53:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:53:25,967 INFO L225 Difference]: With dead ends: 5548 [2023-12-02 15:53:25,967 INFO L226 Difference]: Without dead ends: 4856 [2023-12-02 15:53:25,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:53:25,968 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 149 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:53:25,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 278 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:53:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4856 states. [2023-12-02 15:53:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4856 to 3480. [2023-12-02 15:53:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3479 states have (on average 3.5228513940787582) internal successors, (12256), 3479 states have internal predecessors, (12256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 12256 transitions. [2023-12-02 15:53:26,068 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 12256 transitions. Word has length 38 [2023-12-02 15:53:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:53:26,069 INFO L495 AbstractCegarLoop]: Abstraction has 3480 states and 12256 transitions. [2023-12-02 15:53:26,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:53:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 12256 transitions. [2023-12-02 15:53:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:53:26,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:53:26,076 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, 1] [2023-12-02 15:53:26,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 15:53:26,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:53:26,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:53:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 698874432, now seen corresponding path program 3 times [2023-12-02 15:53:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:53:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979213582] [2023-12-02 15:53:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:53:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:53:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:53:26,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:53:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:53:26,273 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:53:26,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:53:26,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-02 15:53:26,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-02 15:53:26,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-12-02 15:53:26,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-12-02 15:53:26,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-12-02 15:53:26,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-12-02 15:53:26,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-02 15:53:26,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 15:53:26,280 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:53:26,286 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 15:53:26,286 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:53:26,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 15:53:26,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 15:53:26,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 15:53:26,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-12-02 15:53:26,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:53:26 BasicIcfg [2023-12-02 15:53:26,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:53:26,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:53:26,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:53:26,391 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:53:26,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:53:03" (3/4) ... [2023-12-02 15:53:26,393 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 15:53:26,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 15:53:26,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 15:53:26,436 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 15:53:26,436 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-12-02 15:53:26,510 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:53:26,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:53:26,511 INFO L158 Benchmark]: Toolchain (without parser) took 24029.70ms. Allocated memory was 140.5MB in the beginning and 10.6GB in the end (delta: 10.5GB). Free memory was 92.7MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2023-12-02 15:53:26,512 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:53:26,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.69ms. Allocated memory was 140.5MB in the beginning and 197.1MB in the end (delta: 56.6MB). Free memory was 92.7MB in the beginning and 166.8MB in the end (delta: -74.0MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2023-12-02 15:53:26,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.85ms. Allocated memory is still 197.1MB. Free memory was 166.8MB in the beginning and 163.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:53:26,513 INFO L158 Benchmark]: Boogie Preprocessor took 44.04ms. Allocated memory is still 197.1MB. Free memory was 163.7MB in the beginning and 161.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:53:26,513 INFO L158 Benchmark]: RCFGBuilder took 710.52ms. Allocated memory is still 197.1MB. Free memory was 161.6MB in the beginning and 106.0MB in the end (delta: 55.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2023-12-02 15:53:26,513 INFO L158 Benchmark]: TraceAbstraction took 22497.34ms. Allocated memory was 197.1MB in the beginning and 10.6GB in the end (delta: 10.4GB). Free memory was 104.9MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-12-02 15:53:26,514 INFO L158 Benchmark]: Witness Printer took 119.58ms. Allocated memory is still 10.6GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 15:53:26,515 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.19ms. Allocated memory is still 92.3MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.69ms. Allocated memory was 140.5MB in the beginning and 197.1MB in the end (delta: 56.6MB). Free memory was 92.7MB in the beginning and 166.8MB in the end (delta: -74.0MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.85ms. Allocated memory is still 197.1MB. Free memory was 166.8MB in the beginning and 163.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.04ms. Allocated memory is still 197.1MB. Free memory was 163.7MB in the beginning and 161.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 710.52ms. Allocated memory is still 197.1MB. Free memory was 161.6MB in the beginning and 106.0MB in the end (delta: 55.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22497.34ms. Allocated memory was 197.1MB in the beginning and 10.6GB in the end (delta: 10.4GB). Free memory was 104.9MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 119.58ms. Allocated memory is still 10.6GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t353={5:0}, t354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.4s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1475 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1475 mSDsluCounter, 1898 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1433 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2444 IncrementalHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 465 mSDtfsCounter, 2444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36400occurred in iteration=2, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 25764 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 2562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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-12-02 15:53:26,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fdcdaea-2775-4bb8-af57-3ccf66d266a7/bin/utaipan-verify-nQ1chXbOIh/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