/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:37:35,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:37:35,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:37:35,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:37:35,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:37:35,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:37:35,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:37:35,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:37:35,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:37:35,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:37:35,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:37:35,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:37:35,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:37:35,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:37:35,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:37:35,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:37:35,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:37:35,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:37:35,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:37:35,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:37:35,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:37:35,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:37:35,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:37:35,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:37:35,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:37:35,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:37:35,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:37:35,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:37:35,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:37:35,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:37:35,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:37:35,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:37:35,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:37:35,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:37:35,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:37:35,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:37:35,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:37:35,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:37:35,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:37:35,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:37:35,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:37:35,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:37:35,722 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:37:35,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:37:35,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:37:35,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:37:35,724 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:37:35,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:37:35,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:37:35,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:37:35,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:37:35,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:37:35,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:37:35,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:37:35,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:37:35,727 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:37:35,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:37:35,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:37:35,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:37:35,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:37:35,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:37:35,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:37:35,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:37:35,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:35,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:37:35,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:37:35,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:37:35,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:37:35,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:37:35,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:37:35,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2022-12-06 06:37:36,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:37:36,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:37:36,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:37:36,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:37:36,141 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:37:36,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:37:37,394 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:37:37,740 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:37:37,741 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:37:37,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6728ca76/5c414701bc6f495c9d5e39212b26dfb1/FLAG29f67427e [2022-12-06 06:37:37,788 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6728ca76/5c414701bc6f495c9d5e39212b26dfb1 [2022-12-06 06:37:37,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:37:37,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:37:37,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:37,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:37:37,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:37:37,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:37" (1/1) ... [2022-12-06 06:37:37,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377c68e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:37, skipping insertion in model container [2022-12-06 06:37:37,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:37" (1/1) ... [2022-12-06 06:37:37,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:37:37,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:37:38,020 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 06:37:38,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:38,247 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:37:38,258 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 06:37:38,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:38,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:38,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:38,344 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:37:38,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38 WrapperNode [2022-12-06 06:37:38,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:38,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:38,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:37:38,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:37:38,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,396 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-06 06:37:38,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:38,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:37:38,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:37:38,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:37:38,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,432 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:37:38,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:37:38,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:37:38,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:37:38,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (1/1) ... [2022-12-06 06:37:38,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:38,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:37:38,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:37:38,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:37:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:37:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:37:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:37:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:37:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:37:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:37:38,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:37:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:37:38,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:37:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:37:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:37:38,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:37:38,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:37:38,509 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:37:38,664 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:37:38,665 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:37:38,901 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:37:39,052 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:37:39,052 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:37:39,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:39 BoogieIcfgContainer [2022-12-06 06:37:39,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:37:39,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:37:39,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:37:39,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:37:39,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:37:37" (1/3) ... [2022-12-06 06:37:39,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dcbe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:39, skipping insertion in model container [2022-12-06 06:37:39,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:38" (2/3) ... [2022-12-06 06:37:39,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dcbe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:39, skipping insertion in model container [2022-12-06 06:37:39,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:39" (3/3) ... [2022-12-06 06:37:39,065 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:37:39,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:37:39,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:37:39,085 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:37:39,135 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:37:39,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-06 06:37:39,233 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-06 06:37:39,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:39,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 06:37:39,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-06 06:37:39,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-06 06:37:39,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:39,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-06 06:37:39,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-06 06:37:39,301 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-06 06:37:39,302 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:39,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 06:37:39,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-06 06:37:39,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-06 06:37:43,594 INFO L203 LiptonReduction]: Total number of compositions: 68 [2022-12-06 06:37:43,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:37:43,615 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68f42b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:37:43,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:37:43,618 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:37:43,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:43,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:43,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:37:43,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 393761, now seen corresponding path program 1 times [2022-12-06 06:37:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:43,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513972087] [2022-12-06 06:37:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:43,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513972087] [2022-12-06 06:37:43,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513972087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:43,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:43,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:37:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583884358] [2022-12-06 06:37:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:43,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:37:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:37:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:37:43,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:37:43,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:43,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:43,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:37:43,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:44,144 INFO L130 PetriNetUnfolder]: 138/275 cut-off events. [2022-12-06 06:37:44,144 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:37:44,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 275 events. 138/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1228 event pairs, 15 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 526. Up to 205 conditions per place. [2022-12-06 06:37:44,148 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 19 selfloop transitions, 2 changer transitions 6/29 dead transitions. [2022-12-06 06:37:44,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2022-12-06 06:37:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:37:44,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-06 06:37:44,160 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:37:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2022-12-06 06:37:44,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:44,164 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 38 flow [2022-12-06 06:37:44,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2022-12-06 06:37:44,168 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 06:37:44,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:44,169 INFO L89 Accepts]: Start accepts. Operand has 25 places, 15 transitions, 38 flow [2022-12-06 06:37:44,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:44,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:44,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 15 transitions, 38 flow [2022-12-06 06:37:44,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-06 06:37:44,177 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:37:44,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:44,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:37:44,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-06 06:37:44,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 06:37:44,222 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:44,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 06:37:44,224 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 06:37:44,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:44,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:44,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:44,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:37:44,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:44,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1388996673, now seen corresponding path program 1 times [2022-12-06 06:37:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:44,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196327809] [2022-12-06 06:37:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:44,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196327809] [2022-12-06 06:37:44,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196327809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:44,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:44,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381826872] [2022-12-06 06:37:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:44,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:44,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:37:44,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:44,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:44,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:37:44,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:44,955 INFO L130 PetriNetUnfolder]: 104/190 cut-off events. [2022-12-06 06:37:44,955 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 06:37:44,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 190 events. 104/190 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 650 event pairs, 24 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 404. Up to 157 conditions per place. [2022-12-06 06:37:44,957 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2022-12-06 06:37:44,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 88 flow [2022-12-06 06:37:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:37:44,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 06:37:44,959 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:37:44,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 88 flow [2022-12-06 06:37:44,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:44,960 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2022-12-06 06:37:44,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-06 06:37:44,961 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -4 predicate places. [2022-12-06 06:37:44,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:44,961 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 06:37:44,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:44,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:44,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 06:37:44,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 06:37:44,965 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:37:44,965 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:44,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:37:44,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 06:37:44,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 06:37:44,986 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:44,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:37:44,987 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-06 06:37:44,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:44,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:44,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:44,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:37:44,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash -109225308, now seen corresponding path program 1 times [2022-12-06 06:37:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:44,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699724318] [2022-12-06 06:37:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:45,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699724318] [2022-12-06 06:37:45,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699724318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:45,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:45,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563138876] [2022-12-06 06:37:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:45,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:45,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:45,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:37:45,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:45,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:45,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:37:45,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:45,254 INFO L130 PetriNetUnfolder]: 121/239 cut-off events. [2022-12-06 06:37:45,255 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 06:37:45,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 239 events. 121/239 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 964 event pairs, 31 based on Foata normal form. 15/252 useless extension candidates. Maximal degree in co-relation 512. Up to 90 conditions per place. [2022-12-06 06:37:45,260 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 5/28 dead transitions. [2022-12-06 06:37:45,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 127 flow [2022-12-06 06:37:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 06:37:45,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:37:45,262 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 33 transitions. [2022-12-06 06:37:45,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 127 flow [2022-12-06 06:37:45,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:45,264 INFO L231 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2022-12-06 06:37:45,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2022-12-06 06:37:45,266 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-06 06:37:45,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:45,268 INFO L89 Accepts]: Start accepts. Operand has 26 places, 15 transitions, 52 flow [2022-12-06 06:37:45,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:45,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:45,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 15 transitions, 52 flow [2022-12-06 06:37:45,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 52 flow [2022-12-06 06:37:45,275 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:37:45,275 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:37:45,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:37:45,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 52 flow [2022-12-06 06:37:45,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 06:37:45,435 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:37:45,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 06:37:45,437 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 50 flow [2022-12-06 06:37:45,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:45,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:45,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:45,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:37:45,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 644051154, now seen corresponding path program 1 times [2022-12-06 06:37:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:45,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797813076] [2022-12-06 06:37:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:45,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:45,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797813076] [2022-12-06 06:37:45,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797813076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:45,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:45,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836835646] [2022-12-06 06:37:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:45,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:45,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:37:45,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 50 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:45,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:45,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:37:45,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:46,008 INFO L130 PetriNetUnfolder]: 75/143 cut-off events. [2022-12-06 06:37:46,008 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-06 06:37:46,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 143 events. 75/143 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 411 event pairs, 27 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 360. Up to 124 conditions per place. [2022-12-06 06:37:46,010 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2022-12-06 06:37:46,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 112 flow [2022-12-06 06:37:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-06 06:37:46,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:37:46,011 INFO L175 Difference]: Start difference. First operand has 25 places, 14 transitions, 50 flow. Second operand 3 states and 22 transitions. [2022-12-06 06:37:46,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 112 flow [2022-12-06 06:37:46,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 98 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:37:46,013 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 57 flow [2022-12-06 06:37:46,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-06 06:37:46,014 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2022-12-06 06:37:46,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:46,014 INFO L89 Accepts]: Start accepts. Operand has 24 places, 16 transitions, 57 flow [2022-12-06 06:37:46,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:46,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:46,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 57 flow [2022-12-06 06:37:46,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 57 flow [2022-12-06 06:37:46,020 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-06 06:37:46,020 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:37:46,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 24 events. 3/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 40. Up to 10 conditions per place. [2022-12-06 06:37:46,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 57 flow [2022-12-06 06:37:46,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 06:37:46,258 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:37:46,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 06:37:46,259 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 60 flow [2022-12-06 06:37:46,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:46,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:46,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:46,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:37:46,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1875937610, now seen corresponding path program 1 times [2022-12-06 06:37:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427905227] [2022-12-06 06:37:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427905227] [2022-12-06 06:37:46,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427905227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:46,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:46,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:37:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466994119] [2022-12-06 06:37:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:46,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:46,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:46,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:46,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:46,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 06:37:46,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:46,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:46,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 06:37:46,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:46,497 INFO L130 PetriNetUnfolder]: 41/99 cut-off events. [2022-12-06 06:37:46,497 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 06:37:46,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 99 events. 41/99 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 321 event pairs, 8 based on Foata normal form. 16/114 useless extension candidates. Maximal degree in co-relation 253. Up to 47 conditions per place. [2022-12-06 06:37:46,498 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 19 selfloop transitions, 3 changer transitions 14/37 dead transitions. [2022-12-06 06:37:46,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 198 flow [2022-12-06 06:37:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 06:37:46,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-06 06:37:46,500 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 60 flow. Second operand 5 states and 43 transitions. [2022-12-06 06:37:46,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 198 flow [2022-12-06 06:37:46,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 37 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:37:46,502 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 84 flow [2022-12-06 06:37:46,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2022-12-06 06:37:46,503 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-06 06:37:46,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:46,503 INFO L89 Accepts]: Start accepts. Operand has 30 places, 18 transitions, 84 flow [2022-12-06 06:37:46,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:46,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:46,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 84 flow [2022-12-06 06:37:46,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 84 flow [2022-12-06 06:37:46,510 INFO L130 PetriNetUnfolder]: 9/39 cut-off events. [2022-12-06 06:37:46,511 INFO L131 PetriNetUnfolder]: For 17/19 co-relation queries the response was YES. [2022-12-06 06:37:46,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 39 events. 9/39 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 4 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 92. Up to 15 conditions per place. [2022-12-06 06:37:46,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 18 transitions, 84 flow [2022-12-06 06:37:46,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-06 06:37:46,526 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:46,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:37:46,529 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 84 flow [2022-12-06 06:37:46,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:46,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:46,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:46,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:37:46,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1926819399, now seen corresponding path program 1 times [2022-12-06 06:37:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:46,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546163840] [2022-12-06 06:37:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:46,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546163840] [2022-12-06 06:37:46,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546163840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:46,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:46,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184779716] [2022-12-06 06:37:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:46,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:37:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:37:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:37:46,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 06:37:46,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:46,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:46,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 06:37:46,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:46,786 INFO L130 PetriNetUnfolder]: 16/49 cut-off events. [2022-12-06 06:37:46,786 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 06:37:46,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 49 events. 16/49 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 4 based on Foata normal form. 6/55 useless extension candidates. Maximal degree in co-relation 153. Up to 21 conditions per place. [2022-12-06 06:37:46,787 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 17 selfloop transitions, 5 changer transitions 6/29 dead transitions. [2022-12-06 06:37:46,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 182 flow [2022-12-06 06:37:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:37:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:37:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 06:37:46,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 06:37:46,790 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 84 flow. Second operand 6 states and 36 transitions. [2022-12-06 06:37:46,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 182 flow [2022-12-06 06:37:46,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 160 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 06:37:46,792 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 88 flow [2022-12-06 06:37:46,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2022-12-06 06:37:46,795 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-06 06:37:46,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:46,795 INFO L89 Accepts]: Start accepts. Operand has 33 places, 18 transitions, 88 flow [2022-12-06 06:37:46,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:46,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:46,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 18 transitions, 88 flow [2022-12-06 06:37:46,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 18 transitions, 88 flow [2022-12-06 06:37:46,801 INFO L130 PetriNetUnfolder]: 2/21 cut-off events. [2022-12-06 06:37:46,801 INFO L131 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2022-12-06 06:37:46,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 21 events. 2/21 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 46. Up to 7 conditions per place. [2022-12-06 06:37:46,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 18 transitions, 88 flow [2022-12-06 06:37:46,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 06:37:47,769 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:37:47,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 975 [2022-12-06 06:37:47,771 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 15 transitions, 82 flow [2022-12-06 06:37:47,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:47,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:47,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:47,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:37:47,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1989635644, now seen corresponding path program 1 times [2022-12-06 06:37:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:47,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602413082] [2022-12-06 06:37:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:48,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602413082] [2022-12-06 06:37:48,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602413082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:48,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:48,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31491817] [2022-12-06 06:37:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:48,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:37:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:48,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:37:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:37:48,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:37:48,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 15 transitions, 82 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-12-06 06:37:48,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:48,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:37:48,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:48,380 INFO L130 PetriNetUnfolder]: 13/42 cut-off events. [2022-12-06 06:37:48,380 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 06:37:48,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 42 events. 13/42 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 142. Up to 21 conditions per place. [2022-12-06 06:37:48,381 INFO L137 encePairwiseOnDemand]: 5/13 looper letters, 12 selfloop transitions, 6 changer transitions 8/26 dead transitions. [2022-12-06 06:37:48,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 187 flow [2022-12-06 06:37:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:37:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:37:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-12-06 06:37:48,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2948717948717949 [2022-12-06 06:37:48,382 INFO L175 Difference]: Start difference. First operand has 28 places, 15 transitions, 82 flow. Second operand 6 states and 23 transitions. [2022-12-06 06:37:48,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 187 flow [2022-12-06 06:37:48,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 162 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 06:37:48,384 INFO L231 Difference]: Finished difference. Result has 30 places, 15 transitions, 85 flow [2022-12-06 06:37:48,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=85, PETRI_PLACES=30, PETRI_TRANSITIONS=15} [2022-12-06 06:37:48,385 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-06 06:37:48,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:48,385 INFO L89 Accepts]: Start accepts. Operand has 30 places, 15 transitions, 85 flow [2022-12-06 06:37:48,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:48,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:48,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 15 transitions, 85 flow [2022-12-06 06:37:48,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 15 transitions, 85 flow [2022-12-06 06:37:48,390 INFO L130 PetriNetUnfolder]: 2/16 cut-off events. [2022-12-06 06:37:48,390 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:37:48,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 16 events. 2/16 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 41. Up to 5 conditions per place. [2022-12-06 06:37:48,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 15 transitions, 85 flow [2022-12-06 06:37:48,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-06 06:37:48,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] $Ultimate##0-->L748: Formula: (and (= |v_P0Thread1of1ForFork1_~arg#1.base_40| |v_P0Thread1of1ForFork1_#in~arg#1.base_40|) (= 2 v_~y$w_buff0~0_252) (= v_~y$w_buff1~0_211 v_~y$w_buff0~0_253) (= v_~y$w_buff0_used~0_400 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_40| |v_P0Thread1of1ForFork1_#in~arg#1.offset_40|) (= v_~x~0_38 1) (= v_~y$r_buff0_thd1~0_156 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_356 256) 0)) (not (= (mod v_~y$w_buff0_used~0_400 256) 0)))) 1 0)) (= v_~y$r_buff0_thd1~0_157 v_~y$r_buff1_thd1~0_118) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y$w_buff0_used~0_401 v_~y$w_buff1_used~0_356) (= v_~y$r_buff0_thd0~0_226 v_~y$r_buff1_thd0~0_237) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= v_~y$r_buff0_thd2~0_110 v_~y$r_buff1_thd2~0_113)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_401, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_40|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_226, ~y$w_buff0~0=v_~y$w_buff0~0_253, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_157, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_40|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_400, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_40|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_40|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_40|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_211, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_226, ~y$w_buff0~0=v_~y$w_buff0~0_252, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_156, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~x~0=v_~x~0_38, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_356} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [373] $Ultimate##0-->L768: Formula: (and (= v_~x~0_40 v_~__unbuffered_p1_EAX~0_65) (= |v_P1Thread1of1ForFork0_#in~arg.offset_23| v_P1Thread1of1ForFork0_~arg.offset_23) (= v_P1Thread1of1ForFork0_~arg.base_23 |v_P1Thread1of1ForFork0_#in~arg.base_23|) (= v_~y~0_321 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, ~x~0=v_~x~0_40} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, ~y~0=v_~y~0_321, ~x~0=v_~x~0_40} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~y~0] [2022-12-06 06:37:48,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] $Ultimate##0-->L748: Formula: (and (= |v_P0Thread1of1ForFork1_~arg#1.base_40| |v_P0Thread1of1ForFork1_#in~arg#1.base_40|) (= 2 v_~y$w_buff0~0_252) (= v_~y$w_buff1~0_211 v_~y$w_buff0~0_253) (= v_~y$w_buff0_used~0_400 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_40| |v_P0Thread1of1ForFork1_#in~arg#1.offset_40|) (= v_~x~0_38 1) (= v_~y$r_buff0_thd1~0_156 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_356 256) 0)) (not (= (mod v_~y$w_buff0_used~0_400 256) 0)))) 1 0)) (= v_~y$r_buff0_thd1~0_157 v_~y$r_buff1_thd1~0_118) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y$w_buff0_used~0_401 v_~y$w_buff1_used~0_356) (= v_~y$r_buff0_thd0~0_226 v_~y$r_buff1_thd0~0_237) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= v_~y$r_buff0_thd2~0_110 v_~y$r_buff1_thd2~0_113)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_401, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_40|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_226, ~y$w_buff0~0=v_~y$w_buff0~0_253, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_157, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_40|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_400, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_40|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_40|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_40|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_211, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_226, ~y$w_buff0~0=v_~y$w_buff0~0_252, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_156, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~x~0=v_~x~0_38, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_356} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [378] $Ultimate##0-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_500 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_136 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_133 256))))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_501 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_447 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~y~0_404 (ite .cse0 v_~y$w_buff0~0_308 (ite .cse1 v_~y$w_buff1~0_257 1))) (= v_~y$w_buff0_used~0_500 (ite .cse0 0 v_~y$w_buff0_used~0_501)) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_447) v_~y$w_buff1_used~0_446) (= |v_P1Thread1of1ForFork0_#in~arg.offset_37| v_P1Thread1of1ForFork0_~arg.offset_37) (= v_~y$r_buff0_thd2~0_132 (ite .cse2 0 v_~y$r_buff0_thd2~0_133)) (= v_P1Thread1of1ForFork0_~arg.base_37 |v_P1Thread1of1ForFork0_#in~arg.base_37|) (= v_~x~0_66 v_~__unbuffered_p1_EAX~0_83) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_132 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_446 256) 0)))) 0 v_~y$r_buff1_thd2~0_136) v_~y$r_buff1_thd2~0_135)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_136, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_501, ~y$w_buff1~0=v_~y$w_buff1~0_257, ~y$w_buff0~0=v_~y$w_buff0~0_308, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_37|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_133, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_37|, ~x~0=v_~x~0_66, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_447} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_500, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_37, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_37, ~y$w_buff1~0=v_~y$w_buff1~0_257, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_308, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_37|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_132, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_37|, ~y~0=v_~y~0_404, ~x~0=v_~x~0_66, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_446} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:37:48,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] $Ultimate##0-->L775: Formula: (let ((.cse0 (= (mod v_~y$w_buff0_used~0_510 256) 0)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_508 256) 0))) (.cse3 (not (= 0 (mod v_~y$r_buff0_thd2~0_139 256))))) (let ((.cse2 (and .cse4 .cse3)) (.cse1 (and (not .cse0) .cse3))) (and (= v_~x~0_70 v_~__unbuffered_p1_EAX~0_87) (= v_~y$r_buff0_thd1~0_209 v_~y$r_buff1_thd1~0_154) (= (ite .cse0 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|) (= v_~x~0_70 1) (= v_~y$r_buff0_thd1~0_208 1) (= v_P1Thread1of1ForFork0_~arg.base_41 |v_P1Thread1of1ForFork0_#in~arg.base_41|) (= 2 v_~y$w_buff0~0_314) (= v_~y$w_buff1_used~0_452 (ite (or .cse1 .cse2) 0 v_~y$w_buff0_used~0_510)) (= |v_P0Thread1of1ForFork1_~arg#1.base_56| |v_P0Thread1of1ForFork1_#in~arg#1.base_56|) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_139) v_~y$r_buff0_thd2~0_138) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_58| 0)) (= v_~y~0_410 (ite .cse3 v_~y$w_buff0~0_314 (ite .cse1 v_~y$w_buff1~0_261 1))) (= |v_P1Thread1of1ForFork0_#in~arg.offset_41| v_P1Thread1of1ForFork0_~arg.offset_41) (= v_~y$w_buff0_used~0_508 (ite .cse3 0 1)) (= v_~y$r_buff1_thd2~0_141 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_138 256) 0)) .cse4) (and (not (= (mod v_~y$w_buff1_used~0_452 256) 0)) .cse3)) 0 v_~y$r_buff0_thd2~0_139)) (= |v_P0Thread1of1ForFork1_~arg#1.offset_56| |v_P0Thread1of1ForFork1_#in~arg#1.offset_56|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_58| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|) (= v_~y$r_buff0_thd0~0_305 v_~y$r_buff1_thd0~0_320) (= v_~y$w_buff1~0_261 v_~y$w_buff0~0_315)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_56|, ~y$w_buff0~0=v_~y$w_buff0~0_315, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_41|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_305, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_209, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_41|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_56|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_508, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_41, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_56|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_56|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_56|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_56|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_141, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_154, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_41, ~y$w_buff1~0=v_~y$w_buff1~0_261, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_314, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_41|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_305, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_208, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_41|, ~y~0=v_~y~0_410, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_58|, ~x~0=v_~x~0_70, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_320, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_452} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd2~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [277] L748-->L755: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse2))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd1~0_30 (ite .cse0 0 v_~y$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse2) (and .cse3 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff0_used~0_105 (ite .cse4 0 v_~y$w_buff0_used~0_106)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_48 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_62)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:37:49,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] $Ultimate##0-->L768: Formula: (and (= v_~y$r_buff0_thd1~0_204 1) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff1_thd2~0_139) (= v_~y$w_buff0_used~0_505 v_~y$w_buff1_used~0_450) (= |v_P1Thread1of1ForFork0_#in~arg.offset_39| v_P1Thread1of1ForFork0_~arg.offset_39) (= v_~y$w_buff1~0_259 v_~y$w_buff0~0_311) (= |v_P0Thread1of1ForFork1_~arg#1.offset_54| |v_P0Thread1of1ForFork1_#in~arg#1.offset_54|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|) (= v_~y$r_buff0_thd0~0_303 v_~y$r_buff1_thd0~0_318) (= 2 v_~y$w_buff0~0_310) (= v_~y~0_408 1) (= v_~y$r_buff0_thd1~0_205 v_~y$r_buff1_thd1~0_152) (= |v_P0Thread1of1ForFork1_~arg#1.base_54| |v_P0Thread1of1ForFork1_#in~arg#1.base_54|) (= v_P1Thread1of1ForFork0_~arg.base_39 |v_P1Thread1of1ForFork0_#in~arg.base_39|) (= v_~x~0_68 v_~__unbuffered_p1_EAX~0_85) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_504 256) 0)) (not (= (mod v_~y$w_buff1_used~0_450 256) 0)))) 1 0)) (= v_~x~0_68 1) (= v_~y$w_buff0_used~0_504 1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_505, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_54|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_39|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_303, ~y$w_buff0~0=v_~y$w_buff0~0_311, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_205, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_39|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_54|} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_39, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_504, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_54|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_54|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_54|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_54|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_139, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_152, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_259, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_39|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_303, ~y$w_buff0~0=v_~y$w_buff0~0_310, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_204, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_39|, ~y~0=v_~y~0_408, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_56|, ~x~0=v_~x~0_68, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_318, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_450} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [277] L748-->L755: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse2))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd1~0_30 (ite .cse0 0 v_~y$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse2) (and .cse3 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256))))) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff0_used~0_105 (ite .cse4 0 v_~y$w_buff0_used~0_106)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_48 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_62)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_48, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:37:49,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [382] $Ultimate##0-->L755: Formula: (let ((.cse0 (= (mod v_~y$w_buff0_used~0_522 256) 0)) (.cse2 (not (= (mod v_~y$r_buff0_thd1~0_220 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_520 256) 0)))) (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_62| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_62| (ite .cse0 1 0)) (= v_~y$r_buff0_thd2~0_146 v_~y$r_buff1_thd2~0_147) (= |v_P0Thread1of1ForFork1_~arg#1.base_60| |v_P0Thread1of1ForFork1_#in~arg#1.base_60|) (= (ite (or .cse1 (and .cse2 (not .cse0))) 0 v_~y$w_buff0_used~0_522) v_~y$w_buff1_used~0_460) (= v_~x~0_74 v_~__unbuffered_p1_EAX~0_91) (= v_~y~0_416 v_~y$w_buff0~0_322) (= v_P1Thread1of1ForFork0_~arg.base_45 |v_P1Thread1of1ForFork0_#in~arg.base_45|) (= v_~x~0_74 1) (= v_~y$w_buff0_used~0_520 0) (= |v_P0Thread1of1ForFork1_~arg#1.offset_60| |v_P0Thread1of1ForFork1_#in~arg#1.offset_60|) (= v_~y$r_buff1_thd1~0_160 (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_218 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_460 256) 0)) .cse2)) 0 v_~y$r_buff0_thd1~0_220)) (= v_~y$w_buff1~0_265 v_~y$w_buff0~0_323) (= 2 v_~y$w_buff0~0_322) (= v_~y$r_buff0_thd0~0_309 v_~y$r_buff1_thd0~0_324) (= v_~y$r_buff0_thd1~0_218 (ite .cse1 0 1)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_62| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_62|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_45| v_P1Thread1of1ForFork0_~arg.offset_45))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_522, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_60|, ~y$w_buff0~0=v_~y$w_buff0~0_323, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_45|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_220, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_146, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_45|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_60|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_520, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_45, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_60|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_60|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_60|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_60|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_147, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_160, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_45, ~y$w_buff1~0=v_~y$w_buff1~0_265, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, ~y$w_buff0~0=v_~y$w_buff0~0_322, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_45|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_62|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_146, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_45|, ~y~0=v_~y~0_416, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_62|, ~x~0=v_~x~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_324, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_460} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [284] L768-->L775: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_110 256) 0))))) (and (= v_~y~0_65 (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_41 v_~y~0_66))) (= v_~y$r_buff0_thd2~0_25 (ite .cse2 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff1_used~0_98 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite .cse0 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_24) v_~y$r_buff1_thd2~0_23)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_66, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:37:49,721 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:37:49,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1338 [2022-12-06 06:37:49,723 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 11 transitions, 70 flow [2022-12-06 06:37:49,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-12-06 06:37:49,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:49,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:37:49,727 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:37:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash -108559816, now seen corresponding path program 1 times [2022-12-06 06:37:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:49,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025979174] [2022-12-06 06:37:49,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:37:49,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:37:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:37:49,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:37:49,791 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:37:49,791 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:37:49,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:37:49,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:37:49,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:37:49,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:37:49,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:37:49,794 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:49,798 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:37:49,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:37:49,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:37:49 BasicIcfg [2022-12-06 06:37:49,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:37:49,828 INFO L158 Benchmark]: Toolchain (without parser) took 12036.81ms. Allocated memory was 190.8MB in the beginning and 370.1MB in the end (delta: 179.3MB). Free memory was 164.4MB in the beginning and 295.3MB in the end (delta: -130.8MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2022-12-06 06:37:49,828 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 167.5MB in the beginning and 167.4MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:37:49,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.41ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 139.7MB in the end (delta: 24.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 06:37:49,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.28ms. Allocated memory is still 190.8MB. Free memory was 139.7MB in the beginning and 137.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:37:49,829 INFO L158 Benchmark]: Boogie Preprocessor took 38.53ms. Allocated memory is still 190.8MB. Free memory was 137.2MB in the beginning and 135.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:37:49,829 INFO L158 Benchmark]: RCFGBuilder took 620.00ms. Allocated memory is still 190.8MB. Free memory was 135.6MB in the beginning and 103.6MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 06:37:49,829 INFO L158 Benchmark]: TraceAbstraction took 10768.25ms. Allocated memory was 190.8MB in the beginning and 370.1MB in the end (delta: 179.3MB). Free memory was 103.1MB in the beginning and 295.3MB in the end (delta: -192.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:37:49,830 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 167.5MB in the beginning and 167.4MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 549.41ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 139.7MB in the end (delta: 24.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.28ms. Allocated memory is still 190.8MB. Free memory was 139.7MB in the beginning and 137.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.53ms. Allocated memory is still 190.8MB. Free memory was 137.2MB in the beginning and 135.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 620.00ms. Allocated memory is still 190.8MB. Free memory was 135.6MB in the beginning and 103.6MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10768.25ms. Allocated memory was 190.8MB in the beginning and 370.1MB in the end (delta: 179.3MB). Free memory was 103.1MB in the beginning and 295.3MB in the end (delta: -192.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 90 PlacesBefore, 27 PlacesAfterwards, 85 TransitionsBefore, 21 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 833, independent: 791, independent conditional: 791, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 833, independent: 791, independent conditional: 0, independent unconditional: 791, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 833, independent: 791, independent conditional: 0, independent unconditional: 791, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 833, independent: 791, independent conditional: 0, independent unconditional: 791, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 707, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 707, independent: 666, independent conditional: 0, independent unconditional: 666, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 275, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 833, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 707, unknown conditional: 0, unknown unconditional: 707] , Statistics on independence cache: Total cache size (in pairs): 1082, Positive cache size: 1050, Positive conditional cache size: 0, Positive unconditional cache size: 1050, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 30, independent conditional: 9, independent unconditional: 21, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 30, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 41, unknown conditional: 14, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 30, Positive conditional cache size: 9, Positive unconditional cache size: 21, Negative cache size: 11, Negative conditional cache size: 5, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 5, independent unconditional: 26, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 38, Positive conditional cache size: 9, Positive unconditional cache size: 29, Negative cache size: 15, Negative conditional cache size: 5, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 35, independent conditional: 12, independent unconditional: 23, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 45, Positive conditional cache size: 9, Positive unconditional cache size: 36, Negative cache size: 19, Negative conditional cache size: 5, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 24 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 19, independent unconditional: 16, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 35, independent conditional: 12, independent unconditional: 23, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 35, independent conditional: 12, independent unconditional: 23, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 33, independent conditional: 31, independent unconditional: 2, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 61, Positive conditional cache size: 16, Positive unconditional cache size: 45, Negative cache size: 23, Negative conditional cache size: 5, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 61, Positive conditional cache size: 16, Positive unconditional cache size: 45, Negative cache size: 24, Negative conditional cache size: 5, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 31 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 15 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 68, Positive conditional cache size: 20, Positive unconditional cache size: 48, Negative cache size: 24, Negative conditional cache size: 5, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 30 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 11 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 72, Positive conditional cache size: 22, Positive unconditional cache size: 50, Negative cache size: 24, Negative conditional cache size: 5, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-1, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L764] 1 __unbuffered_p1_EAX = x [L767] 1 y = 1 [L770] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 3 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=6, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-12-06 06:37:49,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...