./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:26:57,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:26:57,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:26:57,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:26:57,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:26:57,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:26:57,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:26:57,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:26:57,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:26:57,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:26:57,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:26:57,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:26:57,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:26:57,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:26:57,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:26:57,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:26:57,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:26:57,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:26:57,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:26:57,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:26:57,806 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:26:57,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:26:57,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:26:57,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:26:57,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:26:57,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:26:57,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:26:57,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:26:57,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:26:57,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:26:57,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:26:57,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:26:57,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:26:57,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:26:57,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:26:57,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:26:57,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:26:57,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:26:57,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:26:57,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:26:57,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:26:57,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:26:57,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:26:57,844 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:26:57,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:26:57,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:26:57,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:26:57,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:26:57,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:26:57,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:26:57,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:26:57,846 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:26:57,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:26:57,847 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:26:57,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:26:57,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:26:57,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:26:57,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:26:57,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:26:57,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:26:57,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:26:57,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:26:57,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:26:57,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:26:57,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:26:57,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:26:57,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:26:57,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:26:57,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:26:57,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:26:57,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:26:57,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:26:57,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:26:57,851 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:26:57,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:26:57,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:26:57,851 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2022-07-22 21:26:58,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:26:58,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:26:58,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:26:58,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:26:58,147 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:26:58,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-07-22 21:26:58,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e01e06b6/2d2e2a6f7e284f0fb3e7db7a84f34b4e/FLAG6ec66463b [2022-07-22 21:26:58,670 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:26:58,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-07-22 21:26:58,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e01e06b6/2d2e2a6f7e284f0fb3e7db7a84f34b4e/FLAG6ec66463b [2022-07-22 21:26:59,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e01e06b6/2d2e2a6f7e284f0fb3e7db7a84f34b4e [2022-07-22 21:26:59,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:26:59,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:26:59,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:26:59,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:26:59,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:26:59,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a9c93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59, skipping insertion in model container [2022-07-22 21:26:59,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:26:59,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:26:59,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-22 21:26:59,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:26:59,544 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:26:59,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-22 21:26:59,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:26:59,618 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:26:59,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59 WrapperNode [2022-07-22 21:26:59,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:26:59,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:26:59,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:26:59,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:26:59,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,685 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2022-07-22 21:26:59,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:26:59,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:26:59,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:26:59,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:26:59,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:26:59,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:26:59,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:26:59,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:26:59,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (1/1) ... [2022-07-22 21:26:59,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:26:59,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:26:59,749 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-07-22 21:26:59,751 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-07-22 21:26:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:26:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:26:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:26:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:26:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:26:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:26:59,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:26:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:26:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:26:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:26:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:26:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:26:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:26:59,788 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:26:59,947 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:26:59,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:27:00,307 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:27:00,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:27:00,534 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:27:00,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:27:00 BoogieIcfgContainer [2022-07-22 21:27:00,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:27:00,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:27:00,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:27:00,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:27:00,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:26:59" (1/3) ... [2022-07-22 21:27:00,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5bd2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:27:00, skipping insertion in model container [2022-07-22 21:27:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:26:59" (2/3) ... [2022-07-22 21:27:00,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5bd2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:27:00, skipping insertion in model container [2022-07-22 21:27:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:27:00" (3/3) ... [2022-07-22 21:27:00,542 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-07-22 21:27:00,546 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:27:00,552 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:27:00,552 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:27:00,552 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:27:00,588 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:27:00,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2022-07-22 21:27:00,630 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2022-07-22 21:27:00,631 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:27:00,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-07-22 21:27:00,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2022-07-22 21:27:00,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2022-07-22 21:27:00,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:27:00,646 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ede8242, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ac58af8 [2022-07-22 21:27:00,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-22 21:27:00,651 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2022-07-22 21:27:00,652 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:27:00,652 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:00,652 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:00,653 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-07-22 21:27:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash -761824995, now seen corresponding path program 1 times [2022-07-22 21:27:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431948758] [2022-07-22 21:27:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431948758] [2022-07-22 21:27:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431948758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:00,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:00,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:27:00,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493019567] [2022-07-22 21:27:00,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:00,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:27:00,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:00,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:27:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:27:00,866 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2022-07-22 21:27:00,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-07-22 21:27:00,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:00,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2022-07-22 21:27:00,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:00,952 INFO L129 PetriNetUnfolder]: 18/233 cut-off events. [2022-07-22 21:27:00,952 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 21:27:00,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 233 events. 18/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 803 event pairs, 12 based on Foata normal form. 8/227 useless extension candidates. Maximal degree in co-relation 239. Up to 31 conditions per place. [2022-07-22 21:27:00,955 INFO L132 encePairwiseOnDemand]: 88/93 looper letters, 10 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2022-07-22 21:27:00,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 215 flow [2022-07-22 21:27:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:27:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:27:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-07-22 21:27:00,965 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.931899641577061 [2022-07-22 21:27:00,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2022-07-22 21:27:00,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2022-07-22 21:27:00,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:00,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2022-07-22 21:27:00,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-07-22 21:27:00,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-07-22 21:27:00,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-07-22 21:27:00,975 INFO L186 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 260 transitions. [2022-07-22 21:27:00,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 215 flow [2022-07-22 21:27:00,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:27:00,980 INFO L242 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2022-07-22 21:27:00,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-07-22 21:27:00,983 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2022-07-22 21:27:00,984 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2022-07-22 21:27:00,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-07-22 21:27:00,984 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:00,984 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:00,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:27:00,985 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-07-22 21:27:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash -29849764, now seen corresponding path program 1 times [2022-07-22 21:27:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:00,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213784645] [2022-07-22 21:27:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:01,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213784645] [2022-07-22 21:27:01,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213784645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:01,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:01,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332005555] [2022-07-22 21:27:01,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:01,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:01,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:01,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:01,124 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-07-22 21:27:01,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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-07-22 21:27:01,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:01,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-07-22 21:27:01,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:01,358 INFO L129 PetriNetUnfolder]: 179/654 cut-off events. [2022-07-22 21:27:01,358 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-07-22 21:27:01,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 654 events. 179/654 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3809 event pairs, 62 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 984. Up to 186 conditions per place. [2022-07-22 21:27:01,362 INFO L132 encePairwiseOnDemand]: 86/93 looper letters, 17 selfloop transitions, 3 changer transitions 43/125 dead transitions. [2022-07-22 21:27:01,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 382 flow [2022-07-22 21:27:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:27:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:27:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2022-07-22 21:27:01,366 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2022-07-22 21:27:01,366 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 713 transitions. [2022-07-22 21:27:01,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 713 transitions. [2022-07-22 21:27:01,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:01,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 713 transitions. [2022-07-22 21:27:01,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.22222222222223) internal successors, (713), 9 states have internal predecessors, (713), 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-07-22 21:27:01,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-07-22 21:27:01,371 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-07-22 21:27:01,372 INFO L186 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 9 states and 713 transitions. [2022-07-22 21:27:01,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 382 flow [2022-07-22 21:27:01,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 125 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:27:01,374 INFO L242 Difference]: Finished difference. Result has 107 places, 79 transitions, 201 flow [2022-07-22 21:27:01,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2022-07-22 21:27:01,375 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2022-07-22 21:27:01,375 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 201 flow [2022-07-22 21:27:01,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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-07-22 21:27:01,376 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:01,376 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:01,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:27:01,377 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-07-22 21:27:01,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 600139611, now seen corresponding path program 1 times [2022-07-22 21:27:01,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:01,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039687566] [2022-07-22 21:27:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:01,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:01,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039687566] [2022-07-22 21:27:01,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039687566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:01,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:01,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 21:27:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343374406] [2022-07-22 21:27:01,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:01,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:27:01,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:27:01,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:27:01,573 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-07-22 21:27:01,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 201 flow. Second operand has 11 states, 11 states have (on average 71.27272727272727) internal successors, (784), 11 states have internal predecessors, (784), 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-07-22 21:27:01,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:01,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-07-22 21:27:01,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:01,857 INFO L129 PetriNetUnfolder]: 160/440 cut-off events. [2022-07-22 21:27:01,857 INFO L130 PetriNetUnfolder]: For 343/345 co-relation queries the response was YES. [2022-07-22 21:27:01,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 440 events. 160/440 cut-off events. For 343/345 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1910 event pairs, 45 based on Foata normal form. 12/437 useless extension candidates. Maximal degree in co-relation 956. Up to 170 conditions per place. [2022-07-22 21:27:01,860 INFO L132 encePairwiseOnDemand]: 80/93 looper letters, 16 selfloop transitions, 11 changer transitions 34/122 dead transitions. [2022-07-22 21:27:01,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 441 flow [2022-07-22 21:27:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 21:27:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-22 21:27:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1184 transitions. [2022-07-22 21:27:01,863 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2022-07-22 21:27:01,863 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1184 transitions. [2022-07-22 21:27:01,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1184 transitions. [2022-07-22 21:27:01,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:01,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1184 transitions. [2022-07-22 21:27:01,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 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-07-22 21:27:01,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-07-22 21:27:01,869 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-07-22 21:27:01,869 INFO L186 Difference]: Start difference. First operand has 107 places, 79 transitions, 201 flow. Second operand 16 states and 1184 transitions. [2022-07-22 21:27:01,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 441 flow [2022-07-22 21:27:01,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 420 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-22 21:27:01,874 INFO L242 Difference]: Finished difference. Result has 113 places, 85 transitions, 280 flow [2022-07-22 21:27:01,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=280, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-07-22 21:27:01,875 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2022-07-22 21:27:01,875 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 280 flow [2022-07-22 21:27:01,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.27272727272727) internal successors, (784), 11 states have internal predecessors, (784), 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-07-22 21:27:01,875 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:01,876 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:01,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:27:01,876 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-07-22 21:27:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash -871931512, now seen corresponding path program 1 times [2022-07-22 21:27:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:01,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507586631] [2022-07-22 21:27:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:01,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:01,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507586631] [2022-07-22 21:27:01,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507586631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:01,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:01,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54687154] [2022-07-22 21:27:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:01,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:01,959 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-07-22 21:27:01,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-07-22 21:27:01,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:01,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-07-22 21:27:01,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:02,152 INFO L129 PetriNetUnfolder]: 181/562 cut-off events. [2022-07-22 21:27:02,153 INFO L130 PetriNetUnfolder]: For 1536/1593 co-relation queries the response was YES. [2022-07-22 21:27:02,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 562 events. 181/562 cut-off events. For 1536/1593 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2987 event pairs, 35 based on Foata normal form. 12/557 useless extension candidates. Maximal degree in co-relation 1783. Up to 158 conditions per place. [2022-07-22 21:27:02,156 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 28 selfloop transitions, 3 changer transitions 23/118 dead transitions. [2022-07-22 21:27:02,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 611 flow [2022-07-22 21:27:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:27:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:27:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 705 transitions. [2022-07-22 21:27:02,158 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8422939068100358 [2022-07-22 21:27:02,158 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 705 transitions. [2022-07-22 21:27:02,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 705 transitions. [2022-07-22 21:27:02,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:02,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 705 transitions. [2022-07-22 21:27:02,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.33333333333333) internal successors, (705), 9 states have internal predecessors, (705), 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-07-22 21:27:02,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-07-22 21:27:02,162 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-07-22 21:27:02,162 INFO L186 Difference]: Start difference. First operand has 113 places, 85 transitions, 280 flow. Second operand 9 states and 705 transitions. [2022-07-22 21:27:02,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 611 flow [2022-07-22 21:27:02,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 118 transitions, 577 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-07-22 21:27:02,169 INFO L242 Difference]: Finished difference. Result has 113 places, 85 transitions, 291 flow [2022-07-22 21:27:02,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=291, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-07-22 21:27:02,170 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2022-07-22 21:27:02,170 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 291 flow [2022-07-22 21:27:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-07-22 21:27:02,171 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:02,171 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:02,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:27:02,171 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-07-22 21:27:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 938958484, now seen corresponding path program 1 times [2022-07-22 21:27:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:02,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607923362] [2022-07-22 21:27:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:02,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607923362] [2022-07-22 21:27:02,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607923362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:02,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:27:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014727209] [2022-07-22 21:27:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:27:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:27:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:27:02,296 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-07-22 21:27:02,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 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-07-22 21:27:02,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:02,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-07-22 21:27:02,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:02,563 INFO L129 PetriNetUnfolder]: 146/459 cut-off events. [2022-07-22 21:27:02,563 INFO L130 PetriNetUnfolder]: For 1784/1841 co-relation queries the response was YES. [2022-07-22 21:27:02,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 459 events. 146/459 cut-off events. For 1784/1841 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2208 event pairs, 60 based on Foata normal form. 8/443 useless extension candidates. Maximal degree in co-relation 1517. Up to 199 conditions per place. [2022-07-22 21:27:02,567 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 25 selfloop transitions, 7 changer transitions 25/120 dead transitions. [2022-07-22 21:27:02,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 667 flow [2022-07-22 21:27:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:27:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:27:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1063 transitions. [2022-07-22 21:27:02,570 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8164362519201229 [2022-07-22 21:27:02,570 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1063 transitions. [2022-07-22 21:27:02,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1063 transitions. [2022-07-22 21:27:02,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:02,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1063 transitions. [2022-07-22 21:27:02,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 75.92857142857143) internal successors, (1063), 14 states have internal predecessors, (1063), 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-07-22 21:27:02,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-07-22 21:27:02,574 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-07-22 21:27:02,575 INFO L186 Difference]: Start difference. First operand has 113 places, 85 transitions, 291 flow. Second operand 14 states and 1063 transitions. [2022-07-22 21:27:02,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 667 flow [2022-07-22 21:27:02,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 610 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-07-22 21:27:02,580 INFO L242 Difference]: Finished difference. Result has 123 places, 87 transitions, 327 flow [2022-07-22 21:27:02,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=327, PETRI_PLACES=123, PETRI_TRANSITIONS=87} [2022-07-22 21:27:02,581 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2022-07-22 21:27:02,581 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 87 transitions, 327 flow [2022-07-22 21:27:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 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-07-22 21:27:02,581 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:02,581 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:02,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:27:02,582 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-07-22 21:27:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1370138173, now seen corresponding path program 1 times [2022-07-22 21:27:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:02,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503344276] [2022-07-22 21:27:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:02,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:02,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503344276] [2022-07-22 21:27:02,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503344276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:02,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:02,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:27:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962874549] [2022-07-22 21:27:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:02,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:27:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:27:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:27:02,728 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-07-22 21:27:02,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 87 transitions, 327 flow. Second operand has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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-07-22 21:27:02,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:02,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-07-22 21:27:02,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:03,072 INFO L129 PetriNetUnfolder]: 171/508 cut-off events. [2022-07-22 21:27:03,073 INFO L130 PetriNetUnfolder]: For 2904/2989 co-relation queries the response was YES. [2022-07-22 21:27:03,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 508 events. 171/508 cut-off events. For 2904/2989 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2603 event pairs, 47 based on Foata normal form. 23/503 useless extension candidates. Maximal degree in co-relation 2062. Up to 207 conditions per place. [2022-07-22 21:27:03,077 INFO L132 encePairwiseOnDemand]: 81/93 looper letters, 26 selfloop transitions, 12 changer transitions 32/131 dead transitions. [2022-07-22 21:27:03,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 131 transitions, 831 flow [2022-07-22 21:27:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 21:27:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-22 21:27:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1184 transitions. [2022-07-22 21:27:03,079 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2022-07-22 21:27:03,080 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1184 transitions. [2022-07-22 21:27:03,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1184 transitions. [2022-07-22 21:27:03,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:03,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1184 transitions. [2022-07-22 21:27:03,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 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-07-22 21:27:03,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-07-22 21:27:03,084 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-07-22 21:27:03,085 INFO L186 Difference]: Start difference. First operand has 123 places, 87 transitions, 327 flow. Second operand 16 states and 1184 transitions. [2022-07-22 21:27:03,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 131 transitions, 831 flow [2022-07-22 21:27:03,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 131 transitions, 780 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-07-22 21:27:03,091 INFO L242 Difference]: Finished difference. Result has 133 places, 96 transitions, 451 flow [2022-07-22 21:27:03,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=451, PETRI_PLACES=133, PETRI_TRANSITIONS=96} [2022-07-22 21:27:03,092 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 37 predicate places. [2022-07-22 21:27:03,092 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 96 transitions, 451 flow [2022-07-22 21:27:03,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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-07-22 21:27:03,093 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:03,093 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:03,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:27:03,093 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-07-22 21:27:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash -999123527, now seen corresponding path program 2 times [2022-07-22 21:27:03,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:03,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345288828] [2022-07-22 21:27:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:03,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:03,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345288828] [2022-07-22 21:27:03,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345288828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:03,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:03,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:27:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662210438] [2022-07-22 21:27:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:03,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:27:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:27:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:27:03,227 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-07-22 21:27:03,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 96 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 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-07-22 21:27:03,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:03,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-07-22 21:27:03,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:03,453 INFO L129 PetriNetUnfolder]: 141/462 cut-off events. [2022-07-22 21:27:03,454 INFO L130 PetriNetUnfolder]: For 4564/4625 co-relation queries the response was YES. [2022-07-22 21:27:03,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 462 events. 141/462 cut-off events. For 4564/4625 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2308 event pairs, 40 based on Foata normal form. 31/468 useless extension candidates. Maximal degree in co-relation 2247. Up to 168 conditions per place. [2022-07-22 21:27:03,457 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 21 selfloop transitions, 14 changer transitions 22/119 dead transitions. [2022-07-22 21:27:03,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 119 transitions, 839 flow [2022-07-22 21:27:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:27:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:27:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 901 transitions. [2022-07-22 21:27:03,460 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.807347670250896 [2022-07-22 21:27:03,460 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 901 transitions. [2022-07-22 21:27:03,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 901 transitions. [2022-07-22 21:27:03,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:03,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 901 transitions. [2022-07-22 21:27:03,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 75.08333333333333) internal successors, (901), 12 states have internal predecessors, (901), 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-07-22 21:27:03,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-07-22 21:27:03,464 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-07-22 21:27:03,464 INFO L186 Difference]: Start difference. First operand has 133 places, 96 transitions, 451 flow. Second operand 12 states and 901 transitions. [2022-07-22 21:27:03,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 119 transitions, 839 flow [2022-07-22 21:27:03,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 119 transitions, 761 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-07-22 21:27:03,473 INFO L242 Difference]: Finished difference. Result has 133 places, 95 transitions, 450 flow [2022-07-22 21:27:03,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=450, PETRI_PLACES=133, PETRI_TRANSITIONS=95} [2022-07-22 21:27:03,473 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 37 predicate places. [2022-07-22 21:27:03,474 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 95 transitions, 450 flow [2022-07-22 21:27:03,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 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-07-22 21:27:03,474 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:03,474 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:03,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:27:03,475 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-07-22 21:27:03,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1330604476, now seen corresponding path program 1 times [2022-07-22 21:27:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:03,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865423831] [2022-07-22 21:27:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:03,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865423831] [2022-07-22 21:27:03,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865423831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:03,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:03,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 21:27:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486274948] [2022-07-22 21:27:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:03,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:27:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:27:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:27:03,645 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-07-22 21:27:03,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 95 transitions, 450 flow. Second operand has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 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-07-22 21:27:03,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:03,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-07-22 21:27:03,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:04,013 INFO L129 PetriNetUnfolder]: 107/399 cut-off events. [2022-07-22 21:27:04,013 INFO L130 PetriNetUnfolder]: For 4052/4231 co-relation queries the response was YES. [2022-07-22 21:27:04,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 399 events. 107/399 cut-off events. For 4052/4231 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1970 event pairs, 14 based on Foata normal form. 35/409 useless extension candidates. Maximal degree in co-relation 1883. Up to 102 conditions per place. [2022-07-22 21:27:04,032 INFO L132 encePairwiseOnDemand]: 81/93 looper letters, 24 selfloop transitions, 17 changer transitions 28/130 dead transitions. [2022-07-22 21:27:04,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 130 transitions, 1031 flow [2022-07-22 21:27:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 21:27:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-22 21:27:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1250 transitions. [2022-07-22 21:27:04,035 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7906388361796332 [2022-07-22 21:27:04,035 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1250 transitions. [2022-07-22 21:27:04,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1250 transitions. [2022-07-22 21:27:04,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:04,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1250 transitions. [2022-07-22 21:27:04,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 73.52941176470588) internal successors, (1250), 17 states have internal predecessors, (1250), 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-07-22 21:27:04,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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-07-22 21:27:04,040 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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-07-22 21:27:04,040 INFO L186 Difference]: Start difference. First operand has 133 places, 95 transitions, 450 flow. Second operand 17 states and 1250 transitions. [2022-07-22 21:27:04,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 130 transitions, 1031 flow [2022-07-22 21:27:04,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 879 flow, removed 67 selfloop flow, removed 13 redundant places. [2022-07-22 21:27:04,054 INFO L242 Difference]: Finished difference. Result has 141 places, 95 transitions, 494 flow [2022-07-22 21:27:04,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=494, PETRI_PLACES=141, PETRI_TRANSITIONS=95} [2022-07-22 21:27:04,055 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 45 predicate places. [2022-07-22 21:27:04,055 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 95 transitions, 494 flow [2022-07-22 21:27:04,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 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-07-22 21:27:04,056 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:04,056 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:04,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:27:04,057 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:27:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash -872873794, now seen corresponding path program 1 times [2022-07-22 21:27:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:04,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713029032] [2022-07-22 21:27:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:04,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713029032] [2022-07-22 21:27:04,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713029032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:04,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:04,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931917695] [2022-07-22 21:27:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:04,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:04,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:04,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:04,174 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-07-22 21:27:04,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 95 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-07-22 21:27:04,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:04,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-07-22 21:27:04,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:04,396 INFO L129 PetriNetUnfolder]: 278/750 cut-off events. [2022-07-22 21:27:04,397 INFO L130 PetriNetUnfolder]: For 6949/7044 co-relation queries the response was YES. [2022-07-22 21:27:04,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 750 events. 278/750 cut-off events. For 6949/7044 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4321 event pairs, 21 based on Foata normal form. 54/775 useless extension candidates. Maximal degree in co-relation 3033. Up to 174 conditions per place. [2022-07-22 21:27:04,401 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 27 selfloop transitions, 5 changer transitions 48/144 dead transitions. [2022-07-22 21:27:04,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 144 transitions, 1143 flow [2022-07-22 21:27:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:27:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:27:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-07-22 21:27:04,403 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8376344086021505 [2022-07-22 21:27:04,403 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 779 transitions. [2022-07-22 21:27:04,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 779 transitions. [2022-07-22 21:27:04,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:04,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 779 transitions. [2022-07-22 21:27:04,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.9) internal successors, (779), 10 states have internal predecessors, (779), 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-07-22 21:27:04,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-07-22 21:27:04,408 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-07-22 21:27:04,408 INFO L186 Difference]: Start difference. First operand has 141 places, 95 transitions, 494 flow. Second operand 10 states and 779 transitions. [2022-07-22 21:27:04,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 144 transitions, 1143 flow [2022-07-22 21:27:04,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 144 transitions, 1023 flow, removed 32 selfloop flow, removed 21 redundant places. [2022-07-22 21:27:04,419 INFO L242 Difference]: Finished difference. Result has 126 places, 87 transitions, 381 flow [2022-07-22 21:27:04,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=381, PETRI_PLACES=126, PETRI_TRANSITIONS=87} [2022-07-22 21:27:04,420 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 30 predicate places. [2022-07-22 21:27:04,420 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 87 transitions, 381 flow [2022-07-22 21:27:04,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-07-22 21:27:04,421 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:04,421 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:04,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:27:04,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:27:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash 638868166, now seen corresponding path program 1 times [2022-07-22 21:27:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:04,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126870856] [2022-07-22 21:27:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:04,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:04,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126870856] [2022-07-22 21:27:04,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126870856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:04,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:04,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:27:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582786161] [2022-07-22 21:27:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:04,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:27:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:04,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:27:04,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:27:04,525 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-07-22 21:27:04,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 87 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-07-22 21:27:04,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:04,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-07-22 21:27:04,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:04,651 INFO L129 PetriNetUnfolder]: 54/262 cut-off events. [2022-07-22 21:27:04,652 INFO L130 PetriNetUnfolder]: For 1480/1488 co-relation queries the response was YES. [2022-07-22 21:27:04,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 262 events. 54/262 cut-off events. For 1480/1488 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1066 event pairs, 2 based on Foata normal form. 20/280 useless extension candidates. Maximal degree in co-relation 923. Up to 46 conditions per place. [2022-07-22 21:27:04,653 INFO L132 encePairwiseOnDemand]: 85/93 looper letters, 19 selfloop transitions, 7 changer transitions 21/108 dead transitions. [2022-07-22 21:27:04,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 108 transitions, 691 flow [2022-07-22 21:27:04,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:27:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:27:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 758 transitions. [2022-07-22 21:27:04,656 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8150537634408602 [2022-07-22 21:27:04,656 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 758 transitions. [2022-07-22 21:27:04,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 758 transitions. [2022-07-22 21:27:04,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:04,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 758 transitions. [2022-07-22 21:27:04,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.8) internal successors, (758), 10 states have internal predecessors, (758), 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-07-22 21:27:04,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-07-22 21:27:04,662 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-07-22 21:27:04,662 INFO L186 Difference]: Start difference. First operand has 126 places, 87 transitions, 381 flow. Second operand 10 states and 758 transitions. [2022-07-22 21:27:04,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 108 transitions, 691 flow [2022-07-22 21:27:04,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 488 flow, removed 97 selfloop flow, removed 17 redundant places. [2022-07-22 21:27:04,665 INFO L242 Difference]: Finished difference. Result has 118 places, 83 transitions, 296 flow [2022-07-22 21:27:04,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=118, PETRI_TRANSITIONS=83} [2022-07-22 21:27:04,667 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2022-07-22 21:27:04,667 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 83 transitions, 296 flow [2022-07-22 21:27:04,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-07-22 21:27:04,667 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:04,667 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:04,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:27:04,668 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:27:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1357403074, now seen corresponding path program 1 times [2022-07-22 21:27:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:04,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262279220] [2022-07-22 21:27:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:27:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:04,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262279220] [2022-07-22 21:27:04,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262279220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:04,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:04,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 21:27:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557574215] [2022-07-22 21:27:04,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:04,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:27:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:04,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:27:04,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:27:04,924 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-07-22 21:27:04,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 83 transitions, 296 flow. Second operand has 11 states, 11 states have (on average 69.81818181818181) internal successors, (768), 11 states have internal predecessors, (768), 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-07-22 21:27:04,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:04,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-07-22 21:27:04,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:05,167 INFO L129 PetriNetUnfolder]: 5/141 cut-off events. [2022-07-22 21:27:05,177 INFO L130 PetriNetUnfolder]: For 121/123 co-relation queries the response was YES. [2022-07-22 21:27:05,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 141 events. 5/141 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 266 event pairs, 0 based on Foata normal form. 3/144 useless extension candidates. Maximal degree in co-relation 263. Up to 17 conditions per place. [2022-07-22 21:27:05,180 INFO L132 encePairwiseOnDemand]: 83/93 looper letters, 23 selfloop transitions, 6 changer transitions 9/96 dead transitions. [2022-07-22 21:27:05,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 96 transitions, 406 flow [2022-07-22 21:27:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:27:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:27:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 855 transitions. [2022-07-22 21:27:05,196 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7661290322580645 [2022-07-22 21:27:05,197 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 855 transitions. [2022-07-22 21:27:05,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 855 transitions. [2022-07-22 21:27:05,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:05,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 855 transitions. [2022-07-22 21:27:05,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 71.25) internal successors, (855), 12 states have internal predecessors, (855), 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-07-22 21:27:05,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-07-22 21:27:05,199 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-07-22 21:27:05,199 INFO L186 Difference]: Start difference. First operand has 118 places, 83 transitions, 296 flow. Second operand 12 states and 855 transitions. [2022-07-22 21:27:05,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 96 transitions, 406 flow [2022-07-22 21:27:05,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 96 transitions, 324 flow, removed 19 selfloop flow, removed 21 redundant places. [2022-07-22 21:27:05,202 INFO L242 Difference]: Finished difference. Result has 107 places, 80 transitions, 221 flow [2022-07-22 21:27:05,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=221, PETRI_PLACES=107, PETRI_TRANSITIONS=80} [2022-07-22 21:27:05,202 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2022-07-22 21:27:05,202 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 80 transitions, 221 flow [2022-07-22 21:27:05,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.81818181818181) internal successors, (768), 11 states have internal predecessors, (768), 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-07-22 21:27:05,210 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:05,211 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:05,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:27:05,211 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:27:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 766511394, now seen corresponding path program 2 times [2022-07-22 21:27:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:05,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25327196] [2022-07-22 21:27:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:27:05,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:27:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:27:05,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:27:05,435 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:27:05,436 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-22 21:27:05,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-22 21:27:05,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-22 21:27:05,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-22 21:27:05,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-22 21:27:05,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:27:05,439 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:05,444 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:27:05,444 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:27:05,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:27:05 BasicIcfg [2022-07-22 21:27:05,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:27:05,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:27:05,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:27:05,522 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:27:05,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:27:00" (3/4) ... [2022-07-22 21:27:05,524 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:27:05,587 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:27:05,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:27:05,599 INFO L158 Benchmark]: Toolchain (without parser) took 6415.81ms. Allocated memory was 79.7MB in the beginning and 272.6MB in the end (delta: 192.9MB). Free memory was 40.1MB in the beginning and 147.2MB in the end (delta: -107.1MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. [2022-07-22 21:27:05,600 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 57.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:27:05,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.47ms. Allocated memory was 79.7MB in the beginning and 115.3MB in the end (delta: 35.7MB). Free memory was 39.9MB in the beginning and 75.2MB in the end (delta: -35.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-07-22 21:27:05,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.46ms. Allocated memory is still 115.3MB. Free memory was 75.2MB in the beginning and 72.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 21:27:05,600 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 115.3MB. Free memory was 72.3MB in the beginning and 70.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:27:05,601 INFO L158 Benchmark]: RCFGBuilder took 821.17ms. Allocated memory is still 115.3MB. Free memory was 70.2MB in the beginning and 75.0MB in the end (delta: -4.9MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2022-07-22 21:27:05,601 INFO L158 Benchmark]: TraceAbstraction took 4984.25ms. Allocated memory was 115.3MB in the beginning and 272.6MB in the end (delta: 157.3MB). Free memory was 74.4MB in the beginning and 162.9MB in the end (delta: -88.5MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-07-22 21:27:05,601 INFO L158 Benchmark]: Witness Printer took 65.03ms. Allocated memory is still 272.6MB. Free memory was 162.9MB in the beginning and 147.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 21:27:05,602 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.21ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 57.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.47ms. Allocated memory was 79.7MB in the beginning and 115.3MB in the end (delta: 35.7MB). Free memory was 39.9MB in the beginning and 75.2MB in the end (delta: -35.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.46ms. Allocated memory is still 115.3MB. Free memory was 75.2MB in the beginning and 72.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 115.3MB. Free memory was 72.3MB in the beginning and 70.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 821.17ms. Allocated memory is still 115.3MB. Free memory was 70.2MB in the beginning and 75.0MB in the end (delta: -4.9MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4984.25ms. Allocated memory was 115.3MB in the beginning and 272.6MB in the end (delta: 157.3MB). Free memory was 74.4MB in the beginning and 162.9MB in the end (delta: -88.5MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 65.03ms. Allocated memory is still 272.6MB. Free memory was 162.9MB in the beginning and 147.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={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] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={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] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={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] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={5:0}, t2474={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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 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 [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=2, 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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !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) [L810] 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) [L811] EXPR 0 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)) [L811] 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)) [L812] EXPR 0 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)) [L812] 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)) [L813] EXPR 0 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)) [L813] 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)) [L814] EXPR 0 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)) [L814] 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)) [L815] EXPR 0 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)) [L815] 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)) [L816] EXPR 0 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, 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] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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: 791]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 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: 4.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 482 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 647 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1084 IncrementalHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 99 mSDtfsCounter, 1084 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=8, InterpolantAutomatonStates: 128, 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.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 3826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-07-22 21:27:05,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE