./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix021.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/mix021.opt.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 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:45:28,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:45:28,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:45:28,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:45:28,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:45:28,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:45:28,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:45:28,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:45:28,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:45:28,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:45:28,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:45:28,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:45:28,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:45:28,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:45:28,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:45:28,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:45:28,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:45:28,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:45:28,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:45:28,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:45:28,866 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:45:28,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:45:28,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:45:28,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:45:28,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:45:28,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:45:28,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:45:28,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:45:28,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:45:28,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:45:28,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:45:28,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:45:28,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:45:28,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:45:28,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:45:28,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:45:28,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:45:28,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:45:28,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:45:28,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:45:28,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:45:28,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:45:28,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:45:28,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:45:28,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:45:28,905 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:45:28,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:45:28,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:45:28,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:45:28,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:45:28,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:45:28,906 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:45:28,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:45:28,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:45:28,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:45:28,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:45:28,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:45:28,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:45:28,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:45:28,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:45:28,908 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:45:28,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:45:28,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:45:28,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:45:28,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:45:28,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:45:28,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:45:28,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:45:28,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:45:28,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:45:28,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:45:28,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:45:28,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:45:28,910 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:45:28,910 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:45:28,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:45:28,911 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 -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db [2022-07-13 21:45:29,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:45:29,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:45:29,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:45:29,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:45:29,142 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:45:29,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021.opt.i [2022-07-13 21:45:29,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723a94682/ea9e2855427f47debe57959329357993/FLAG286a5fb1c [2022-07-13 21:45:29,611 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:45:29,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021.opt.i [2022-07-13 21:45:29,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723a94682/ea9e2855427f47debe57959329357993/FLAG286a5fb1c [2022-07-13 21:45:29,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723a94682/ea9e2855427f47debe57959329357993 [2022-07-13 21:45:29,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:45:29,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:45:29,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:45:29,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:45:29,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:45:29,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:45:29" (1/1) ... [2022-07-13 21:45:29,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd6524d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:29, skipping insertion in model container [2022-07-13 21:45:29,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:45:29" (1/1) ... [2022-07-13 21:45:29,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:45:29,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:45:29,892 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/mix021.opt.i[944,957] [2022-07-13 21:45:30,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:45:30,086 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:45:30,096 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/mix021.opt.i[944,957] [2022-07-13 21:45:30,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:45:30,147 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:45:30,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30 WrapperNode [2022-07-13 21:45:30,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:45:30,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:45:30,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:45:30,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:45:30,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,202 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 294 [2022-07-13 21:45:30,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:45:30,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:45:30,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:45:30,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:45:30,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:45:30,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:45:30,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:45:30,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:45:30,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (1/1) ... [2022-07-13 21:45:30,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:45:30,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:45:30,278 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-13 21:45:30,288 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-13 21:45:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:45:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:45:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:45:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:45:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:45:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:45:30,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:45:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:45:30,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:45:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-13 21:45:30,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-13 21:45:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-13 21:45:30,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-13 21:45:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:45:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:45:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:45:30,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:45:30,314 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:45:30,403 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:45:30,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:45:30,922 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:45:31,163 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:45:31,163 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:45:31,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:45:31 BoogieIcfgContainer [2022-07-13 21:45:31,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:45:31,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:45:31,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:45:31,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:45:31,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:45:29" (1/3) ... [2022-07-13 21:45:31,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d506f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:45:31, skipping insertion in model container [2022-07-13 21:45:31,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:30" (2/3) ... [2022-07-13 21:45:31,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d506f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:45:31, skipping insertion in model container [2022-07-13 21:45:31,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:45:31" (3/3) ... [2022-07-13 21:45:31,170 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2022-07-13 21:45:31,173 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:45:31,179 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:45:31,180 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:45:31,180 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:45:31,230 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:45:31,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-07-13 21:45:31,299 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2022-07-13 21:45:31,300 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:45:31,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-07-13 21:45:31,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-07-13 21:45:31,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-07-13 21:45:31,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:45:31,315 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@4b69da34, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bb047f9 [2022-07-13 21:45:31,315 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-13 21:45:31,326 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2022-07-13 21:45:31,326 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:45:31,326 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:31,326 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] [2022-07-13 21:45:31,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash 873912980, now seen corresponding path program 1 times [2022-07-13 21:45:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:31,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802917314] [2022-07-13 21:45:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:31,575 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-13 21:45:31,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:31,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802917314] [2022-07-13 21:45:31,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802917314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:31,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:31,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:45:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377513443] [2022-07-13 21:45:31,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:31,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:45:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:31,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:45:31,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:45:31,601 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 134 [2022-07-13 21:45:31,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-13 21:45:31,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:31,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 134 [2022-07-13 21:45:31,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:31,677 INFO L129 PetriNetUnfolder]: 14/211 cut-off events. [2022-07-13 21:45:31,678 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-13 21:45:31,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 211 events. 14/211 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 433 event pairs, 6 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 205. Up to 25 conditions per place. [2022-07-13 21:45:31,680 INFO L132 encePairwiseOnDemand]: 129/134 looper letters, 10 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2022-07-13 21:45:31,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 128 transitions, 292 flow [2022-07-13 21:45:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:45:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:45:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-07-13 21:45:31,698 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9378109452736318 [2022-07-13 21:45:31,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2022-07-13 21:45:31,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2022-07-13 21:45:31,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:31,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2022-07-13 21:45:31,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-13 21:45:31,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-13 21:45:31,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-13 21:45:31,716 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 3 states and 377 transitions. [2022-07-13 21:45:31,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 128 transitions, 292 flow [2022-07-13 21:45:31,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 21:45:31,722 INFO L242 Difference]: Finished difference. Result has 137 places, 126 transitions, 264 flow [2022-07-13 21:45:31,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2022-07-13 21:45:31,727 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -4 predicate places. [2022-07-13 21:45:31,727 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 264 flow [2022-07-13 21:45:31,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-13 21:45:31,728 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:31,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:31,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:45:31,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash -279105822, now seen corresponding path program 1 times [2022-07-13 21:45:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:31,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709217765] [2022-07-13 21:45:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:32,027 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-13 21:45:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709217765] [2022-07-13 21:45:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709217765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:32,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454617720] [2022-07-13 21:45:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:32,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:32,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:32,035 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 134 [2022-07-13 21:45:32,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 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-13 21:45:32,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:32,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 134 [2022-07-13 21:45:32,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:33,293 INFO L129 PetriNetUnfolder]: 3270/7989 cut-off events. [2022-07-13 21:45:33,293 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-07-13 21:45:33,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12897 conditions, 7989 events. 3270/7989 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 73865 event pairs, 390 based on Foata normal form. 0/7802 useless extension candidates. Maximal degree in co-relation 12837. Up to 1496 conditions per place. [2022-07-13 21:45:33,331 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 35 selfloop transitions, 8 changer transitions 92/222 dead transitions. [2022-07-13 21:45:33,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 222 transitions, 706 flow [2022-07-13 21:45:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:45:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:45:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1477 transitions. [2022-07-13 21:45:33,335 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8478760045924225 [2022-07-13 21:45:33,335 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1477 transitions. [2022-07-13 21:45:33,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1477 transitions. [2022-07-13 21:45:33,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:33,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1477 transitions. [2022-07-13 21:45:33,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.61538461538461) internal successors, (1477), 13 states have internal predecessors, (1477), 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-13 21:45:33,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:33,343 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:33,343 INFO L186 Difference]: Start difference. First operand has 137 places, 126 transitions, 264 flow. Second operand 13 states and 1477 transitions. [2022-07-13 21:45:33,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 222 transitions, 706 flow [2022-07-13 21:45:33,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 222 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:45:33,348 INFO L242 Difference]: Finished difference. Result has 159 places, 118 transitions, 346 flow [2022-07-13 21:45:33,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=346, PETRI_PLACES=159, PETRI_TRANSITIONS=118} [2022-07-13 21:45:33,349 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 18 predicate places. [2022-07-13 21:45:33,349 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 118 transitions, 346 flow [2022-07-13 21:45:33,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 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-13 21:45:33,350 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:33,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:33,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:45:33,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1634235661, now seen corresponding path program 1 times [2022-07-13 21:45:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:33,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221150949] [2022-07-13 21:45:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:33,538 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-13 21:45:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:33,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221150949] [2022-07-13 21:45:33,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221150949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:33,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:33,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810279481] [2022-07-13 21:45:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:33,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:33,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:33,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:33,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:33,542 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 134 [2022-07-13 21:45:33,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 118 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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-13 21:45:33,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:33,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 134 [2022-07-13 21:45:33,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:34,371 INFO L129 PetriNetUnfolder]: 2117/4299 cut-off events. [2022-07-13 21:45:34,371 INFO L130 PetriNetUnfolder]: For 10723/10723 co-relation queries the response was YES. [2022-07-13 21:45:34,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15056 conditions, 4299 events. 2117/4299 cut-off events. For 10723/10723 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32113 event pairs, 152 based on Foata normal form. 87/4273 useless extension candidates. Maximal degree in co-relation 14984. Up to 1261 conditions per place. [2022-07-13 21:45:34,404 INFO L132 encePairwiseOnDemand]: 120/134 looper letters, 41 selfloop transitions, 18 changer transitions 70/216 dead transitions. [2022-07-13 21:45:34,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 216 transitions, 1284 flow [2022-07-13 21:45:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:45:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:45:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1478 transitions. [2022-07-13 21:45:34,408 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8484500574052812 [2022-07-13 21:45:34,408 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1478 transitions. [2022-07-13 21:45:34,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1478 transitions. [2022-07-13 21:45:34,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:34,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1478 transitions. [2022-07-13 21:45:34,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.6923076923077) internal successors, (1478), 13 states have internal predecessors, (1478), 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-13 21:45:34,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:34,415 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:34,415 INFO L186 Difference]: Start difference. First operand has 159 places, 118 transitions, 346 flow. Second operand 13 states and 1478 transitions. [2022-07-13 21:45:34,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 216 transitions, 1284 flow [2022-07-13 21:45:34,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 216 transitions, 1256 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-07-13 21:45:34,440 INFO L242 Difference]: Finished difference. Result has 156 places, 127 transitions, 523 flow [2022-07-13 21:45:34,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=523, PETRI_PLACES=156, PETRI_TRANSITIONS=127} [2022-07-13 21:45:34,442 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 15 predicate places. [2022-07-13 21:45:34,442 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 127 transitions, 523 flow [2022-07-13 21:45:34,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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-13 21:45:34,443 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:34,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:34,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:45:34,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1577828390, now seen corresponding path program 1 times [2022-07-13 21:45:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:34,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4094012] [2022-07-13 21:45:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:34,606 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-13 21:45:34,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:34,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4094012] [2022-07-13 21:45:34,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4094012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:34,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:34,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:45:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915230655] [2022-07-13 21:45:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:34,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:45:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:34,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:45:34,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:45:34,612 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2022-07-13 21:45:34,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 127 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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-13 21:45:34,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:34,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2022-07-13 21:45:34,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:35,226 INFO L129 PetriNetUnfolder]: 1368/3039 cut-off events. [2022-07-13 21:45:35,226 INFO L130 PetriNetUnfolder]: For 15193/16155 co-relation queries the response was YES. [2022-07-13 21:45:35,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12620 conditions, 3039 events. 1368/3039 cut-off events. For 15193/16155 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22586 event pairs, 461 based on Foata normal form. 197/3042 useless extension candidates. Maximal degree in co-relation 12538. Up to 1134 conditions per place. [2022-07-13 21:45:35,260 INFO L132 encePairwiseOnDemand]: 127/134 looper letters, 31 selfloop transitions, 7 changer transitions 43/183 dead transitions. [2022-07-13 21:45:35,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 183 transitions, 1189 flow [2022-07-13 21:45:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:45:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:45:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1055 transitions. [2022-07-13 21:45:35,264 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8747927031509121 [2022-07-13 21:45:35,264 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1055 transitions. [2022-07-13 21:45:35,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1055 transitions. [2022-07-13 21:45:35,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:35,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1055 transitions. [2022-07-13 21:45:35,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-13 21:45:35,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-13 21:45:35,271 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-13 21:45:35,271 INFO L186 Difference]: Start difference. First operand has 156 places, 127 transitions, 523 flow. Second operand 9 states and 1055 transitions. [2022-07-13 21:45:35,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 183 transitions, 1189 flow [2022-07-13 21:45:35,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 1141 flow, removed 24 selfloop flow, removed 9 redundant places. [2022-07-13 21:45:35,295 INFO L242 Difference]: Finished difference. Result has 153 places, 133 transitions, 642 flow [2022-07-13 21:45:35,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=642, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2022-07-13 21:45:35,298 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 12 predicate places. [2022-07-13 21:45:35,298 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 642 flow [2022-07-13 21:45:35,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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-13 21:45:35,299 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:35,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:35,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:45:35,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1310412060, now seen corresponding path program 1 times [2022-07-13 21:45:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:35,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719930191] [2022-07-13 21:45:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:35,446 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-13 21:45:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:35,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719930191] [2022-07-13 21:45:35,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719930191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:35,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:35,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657129705] [2022-07-13 21:45:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:35,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:35,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:35,448 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 134 [2022-07-13 21:45:35,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 642 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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-13 21:45:35,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:35,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 134 [2022-07-13 21:45:35,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:36,255 INFO L129 PetriNetUnfolder]: 1500/3774 cut-off events. [2022-07-13 21:45:36,256 INFO L130 PetriNetUnfolder]: For 17799/17835 co-relation queries the response was YES. [2022-07-13 21:45:36,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15051 conditions, 3774 events. 1500/3774 cut-off events. For 17799/17835 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 31008 event pairs, 331 based on Foata normal form. 57/3644 useless extension candidates. Maximal degree in co-relation 14965. Up to 945 conditions per place. [2022-07-13 21:45:36,329 INFO L132 encePairwiseOnDemand]: 120/134 looper letters, 47 selfloop transitions, 26 changer transitions 59/219 dead transitions. [2022-07-13 21:45:36,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 219 transitions, 1658 flow [2022-07-13 21:45:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:45:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:45:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1456 transitions. [2022-07-13 21:45:36,333 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.835820895522388 [2022-07-13 21:45:36,333 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1456 transitions. [2022-07-13 21:45:36,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1456 transitions. [2022-07-13 21:45:36,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:36,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1456 transitions. [2022-07-13 21:45:36,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 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-13 21:45:36,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:36,339 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:36,339 INFO L186 Difference]: Start difference. First operand has 153 places, 133 transitions, 642 flow. Second operand 13 states and 1456 transitions. [2022-07-13 21:45:36,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 219 transitions, 1658 flow [2022-07-13 21:45:36,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 219 transitions, 1604 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-07-13 21:45:36,356 INFO L242 Difference]: Finished difference. Result has 167 places, 140 transitions, 849 flow [2022-07-13 21:45:36,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=849, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2022-07-13 21:45:36,358 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 26 predicate places. [2022-07-13 21:45:36,358 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 849 flow [2022-07-13 21:45:36,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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-13 21:45:36,359 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:36,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:36,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:45:36,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash -776145827, now seen corresponding path program 1 times [2022-07-13 21:45:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:36,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440740959] [2022-07-13 21:45:36,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:36,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:36,439 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-13 21:45:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:36,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440740959] [2022-07-13 21:45:36,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440740959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:36,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:36,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:45:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86565825] [2022-07-13 21:45:36,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:36,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:45:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:36,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:45:36,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:45:36,442 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-07-13 21:45:36,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 849 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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-13 21:45:36,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:36,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-07-13 21:45:36,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:39,361 INFO L129 PetriNetUnfolder]: 11617/20881 cut-off events. [2022-07-13 21:45:39,361 INFO L130 PetriNetUnfolder]: For 78497/98444 co-relation queries the response was YES. [2022-07-13 21:45:39,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62604 conditions, 20881 events. 11617/20881 cut-off events. For 78497/98444 co-relation queries the response was YES. Maximal size of possible extension queue 1485. Compared 187841 event pairs, 489 based on Foata normal form. 508/19958 useless extension candidates. Maximal degree in co-relation 62508. Up to 7163 conditions per place. [2022-07-13 21:45:39,535 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 90 selfloop transitions, 20 changer transitions 22/245 dead transitions. [2022-07-13 21:45:39,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 245 transitions, 1914 flow [2022-07-13 21:45:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:45:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:45:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1181 transitions. [2022-07-13 21:45:39,538 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8813432835820896 [2022-07-13 21:45:39,539 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1181 transitions. [2022-07-13 21:45:39,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1181 transitions. [2022-07-13 21:45:39,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:39,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1181 transitions. [2022-07-13 21:45:39,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.1) internal successors, (1181), 10 states have internal predecessors, (1181), 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-13 21:45:39,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 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-13 21:45:39,543 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 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-13 21:45:39,543 INFO L186 Difference]: Start difference. First operand has 167 places, 140 transitions, 849 flow. Second operand 10 states and 1181 transitions. [2022-07-13 21:45:39,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 245 transitions, 1914 flow [2022-07-13 21:45:39,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 245 transitions, 1890 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-07-13 21:45:39,589 INFO L242 Difference]: Finished difference. Result has 170 places, 158 transitions, 968 flow [2022-07-13 21:45:39,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=968, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2022-07-13 21:45:39,590 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 29 predicate places. [2022-07-13 21:45:39,590 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 968 flow [2022-07-13 21:45:39,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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-13 21:45:39,591 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:39,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:45:39,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2109004218, now seen corresponding path program 1 times [2022-07-13 21:45:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547879488] [2022-07-13 21:45:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:39,716 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-13 21:45:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:39,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547879488] [2022-07-13 21:45:39,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547879488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:39,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:39,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:39,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726048049] [2022-07-13 21:45:39,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:39,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:39,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:39,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:39,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:39,722 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 134 [2022-07-13 21:45:39,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 968 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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-13 21:45:39,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:39,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 134 [2022-07-13 21:45:39,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:41,615 INFO L129 PetriNetUnfolder]: 3765/11879 cut-off events. [2022-07-13 21:45:41,615 INFO L130 PetriNetUnfolder]: For 44534/47654 co-relation queries the response was YES. [2022-07-13 21:45:41,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40903 conditions, 11879 events. 3765/11879 cut-off events. For 44534/47654 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 142596 event pairs, 1186 based on Foata normal form. 239/11014 useless extension candidates. Maximal degree in co-relation 40797. Up to 3224 conditions per place. [2022-07-13 21:45:41,796 INFO L132 encePairwiseOnDemand]: 120/134 looper letters, 93 selfloop transitions, 43 changer transitions 0/241 dead transitions. [2022-07-13 21:45:41,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 241 transitions, 2152 flow [2022-07-13 21:45:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:45:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:45:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1457 transitions. [2022-07-13 21:45:41,800 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8363949483352469 [2022-07-13 21:45:41,800 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1457 transitions. [2022-07-13 21:45:41,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1457 transitions. [2022-07-13 21:45:41,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:41,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1457 transitions. [2022-07-13 21:45:41,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.07692307692308) internal successors, (1457), 13 states have internal predecessors, (1457), 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-13 21:45:41,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:41,806 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:41,806 INFO L186 Difference]: Start difference. First operand has 170 places, 158 transitions, 968 flow. Second operand 13 states and 1457 transitions. [2022-07-13 21:45:41,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 241 transitions, 2152 flow [2022-07-13 21:45:41,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 241 transitions, 2101 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:45:41,906 INFO L242 Difference]: Finished difference. Result has 192 places, 184 transitions, 1561 flow [2022-07-13 21:45:41,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1561, PETRI_PLACES=192, PETRI_TRANSITIONS=184} [2022-07-13 21:45:41,907 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 51 predicate places. [2022-07-13 21:45:41,907 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 1561 flow [2022-07-13 21:45:41,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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-13 21:45:41,908 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:41,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:41,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:45:41,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1811130800, now seen corresponding path program 1 times [2022-07-13 21:45:41,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:41,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82138508] [2022-07-13 21:45:41,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:41,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:42,008 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-13 21:45:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82138508] [2022-07-13 21:45:42,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82138508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:42,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:42,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:42,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391958999] [2022-07-13 21:45:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:42,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:42,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:42,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:42,012 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-07-13 21:45:42,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 184 transitions, 1561 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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-13 21:45:42,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:42,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-07-13 21:45:42,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:46,976 INFO L129 PetriNetUnfolder]: 16296/30366 cut-off events. [2022-07-13 21:45:46,976 INFO L130 PetriNetUnfolder]: For 156934/182671 co-relation queries the response was YES. [2022-07-13 21:45:47,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124774 conditions, 30366 events. 16296/30366 cut-off events. For 156934/182671 co-relation queries the response was YES. Maximal size of possible extension queue 2165. Compared 299889 event pairs, 533 based on Foata normal form. 1332/30517 useless extension candidates. Maximal degree in co-relation 124657. Up to 9556 conditions per place. [2022-07-13 21:45:47,420 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 121 selfloop transitions, 38 changer transitions 57/343 dead transitions. [2022-07-13 21:45:47,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 343 transitions, 3699 flow [2022-07-13 21:45:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:45:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:45:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1539 transitions. [2022-07-13 21:45:47,424 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.883467278989667 [2022-07-13 21:45:47,424 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1539 transitions. [2022-07-13 21:45:47,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1539 transitions. [2022-07-13 21:45:47,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:47,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1539 transitions. [2022-07-13 21:45:47,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.38461538461539) internal successors, (1539), 13 states have internal predecessors, (1539), 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-13 21:45:47,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:47,431 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:45:47,431 INFO L186 Difference]: Start difference. First operand has 192 places, 184 transitions, 1561 flow. Second operand 13 states and 1539 transitions. [2022-07-13 21:45:47,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 343 transitions, 3699 flow [2022-07-13 21:45:48,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 343 transitions, 3569 flow, removed 65 selfloop flow, removed 0 redundant places. [2022-07-13 21:45:48,235 INFO L242 Difference]: Finished difference. Result has 210 places, 192 transitions, 1523 flow [2022-07-13 21:45:48,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1523, PETRI_PLACES=210, PETRI_TRANSITIONS=192} [2022-07-13 21:45:48,236 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 69 predicate places. [2022-07-13 21:45:48,236 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 192 transitions, 1523 flow [2022-07-13 21:45:48,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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-13 21:45:48,236 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:48,237 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, 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-13 21:45:48,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:45:48,237 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -328428019, now seen corresponding path program 1 times [2022-07-13 21:45:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:48,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881424804] [2022-07-13 21:45:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:48,344 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-13 21:45:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:48,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881424804] [2022-07-13 21:45:48,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881424804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:48,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:48,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:45:48,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787160412] [2022-07-13 21:45:48,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:48,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:45:48,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:45:48,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:45:48,347 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-07-13 21:45:48,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 192 transitions, 1523 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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-13 21:45:48,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:48,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-07-13 21:45:48,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:53,055 INFO L129 PetriNetUnfolder]: 13769/26694 cut-off events. [2022-07-13 21:45:53,055 INFO L130 PetriNetUnfolder]: For 175459/201885 co-relation queries the response was YES. [2022-07-13 21:45:53,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127649 conditions, 26694 events. 13769/26694 cut-off events. For 175459/201885 co-relation queries the response was YES. Maximal size of possible extension queue 2129. Compared 275976 event pairs, 189 based on Foata normal form. 1319/26864 useless extension candidates. Maximal degree in co-relation 127523. Up to 8108 conditions per place. [2022-07-13 21:45:53,381 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 117 selfloop transitions, 54 changer transitions 70/355 dead transitions. [2022-07-13 21:45:53,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 355 transitions, 3710 flow [2022-07-13 21:45:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:45:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-13 21:45:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1896 transitions. [2022-07-13 21:45:53,387 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8843283582089553 [2022-07-13 21:45:53,387 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1896 transitions. [2022-07-13 21:45:53,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1896 transitions. [2022-07-13 21:45:53,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:53,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1896 transitions. [2022-07-13 21:45:53,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 118.5) internal successors, (1896), 16 states have internal predecessors, (1896), 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-13 21:45:53,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 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-13 21:45:53,396 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 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-13 21:45:53,396 INFO L186 Difference]: Start difference. First operand has 210 places, 192 transitions, 1523 flow. Second operand 16 states and 1896 transitions. [2022-07-13 21:45:53,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 355 transitions, 3710 flow [2022-07-13 21:45:57,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 355 transitions, 3514 flow, removed 63 selfloop flow, removed 9 redundant places. [2022-07-13 21:45:57,189 INFO L242 Difference]: Finished difference. Result has 220 places, 201 transitions, 1631 flow [2022-07-13 21:45:57,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1631, PETRI_PLACES=220, PETRI_TRANSITIONS=201} [2022-07-13 21:45:57,190 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 79 predicate places. [2022-07-13 21:45:57,190 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 1631 flow [2022-07-13 21:45:57,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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-13 21:45:57,190 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:57,190 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, 1, 1, 1, 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-13 21:45:57,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:45:57,191 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:45:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash -403841670, now seen corresponding path program 1 times [2022-07-13 21:45:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:57,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076182994] [2022-07-13 21:45:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:57,306 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-13 21:45:57,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:57,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076182994] [2022-07-13 21:45:57,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076182994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:57,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:57,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:45:57,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407733878] [2022-07-13 21:45:57,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:57,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:45:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:57,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:45:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:45:57,308 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-07-13 21:45:57,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 201 transitions, 1631 flow. Second operand has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 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-13 21:45:57,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:57,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-07-13 21:45:57,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:46:01,640 INFO L129 PetriNetUnfolder]: 12934/25689 cut-off events. [2022-07-13 21:46:01,641 INFO L130 PetriNetUnfolder]: For 173230/196260 co-relation queries the response was YES. [2022-07-13 21:46:01,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120845 conditions, 25689 events. 12934/25689 cut-off events. For 173230/196260 co-relation queries the response was YES. Maximal size of possible extension queue 2114. Compared 272458 event pairs, 179 based on Foata normal form. 891/25442 useless extension candidates. Maximal degree in co-relation 120787. Up to 4941 conditions per place. [2022-07-13 21:46:01,917 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 80 selfloop transitions, 55 changer transitions 88/334 dead transitions. [2022-07-13 21:46:01,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 334 transitions, 3418 flow [2022-07-13 21:46:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 21:46:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-13 21:46:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2210 transitions. [2022-07-13 21:46:01,921 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8680282796543598 [2022-07-13 21:46:01,922 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2210 transitions. [2022-07-13 21:46:01,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2210 transitions. [2022-07-13 21:46:01,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:46:01,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2210 transitions. [2022-07-13 21:46:01,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 116.3157894736842) internal successors, (2210), 19 states have internal predecessors, (2210), 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-13 21:46:01,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 134.0) internal successors, (2680), 20 states have internal predecessors, (2680), 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-13 21:46:01,929 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 134.0) internal successors, (2680), 20 states have internal predecessors, (2680), 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-13 21:46:01,929 INFO L186 Difference]: Start difference. First operand has 220 places, 201 transitions, 1631 flow. Second operand 19 states and 2210 transitions. [2022-07-13 21:46:01,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 334 transitions, 3418 flow [2022-07-13 21:46:07,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 334 transitions, 2758 flow, removed 272 selfloop flow, removed 30 redundant places. [2022-07-13 21:46:07,965 INFO L242 Difference]: Finished difference. Result has 206 places, 190 transitions, 1229 flow [2022-07-13 21:46:07,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1229, PETRI_PLACES=206, PETRI_TRANSITIONS=190} [2022-07-13 21:46:07,966 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 65 predicate places. [2022-07-13 21:46:07,966 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 190 transitions, 1229 flow [2022-07-13 21:46:07,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 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-13 21:46:07,967 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:46:07,967 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, 1, 1, 1, 1, 1, 1, 1, 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-13 21:46:07,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:46:07,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:46:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:46:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1068734240, now seen corresponding path program 1 times [2022-07-13 21:46:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:46:07,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634175031] [2022-07-13 21:46:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:46:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:46:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:46:08,072 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-13 21:46:08,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:46:08,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634175031] [2022-07-13 21:46:08,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634175031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:46:08,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:46:08,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:46:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242197325] [2022-07-13 21:46:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:46:08,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:46:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:46:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:46:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:46:08,075 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 134 [2022-07-13 21:46:08,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 190 transitions, 1229 flow. Second operand has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 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-13 21:46:08,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:46:08,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 134 [2022-07-13 21:46:08,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:46:09,100 INFO L129 PetriNetUnfolder]: 2156/8472 cut-off events. [2022-07-13 21:46:09,100 INFO L130 PetriNetUnfolder]: For 20557/21437 co-relation queries the response was YES. [2022-07-13 21:46:09,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27210 conditions, 8472 events. 2156/8472 cut-off events. For 20557/21437 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 109789 event pairs, 60 based on Foata normal form. 16/8005 useless extension candidates. Maximal degree in co-relation 27100. Up to 813 conditions per place. [2022-07-13 21:46:09,184 INFO L132 encePairwiseOnDemand]: 119/134 looper letters, 45 selfloop transitions, 30 changer transitions 16/231 dead transitions. [2022-07-13 21:46:09,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 231 transitions, 1783 flow [2022-07-13 21:46:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 21:46:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 21:46:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 880 transitions. [2022-07-13 21:46:09,186 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8208955223880597 [2022-07-13 21:46:09,186 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 880 transitions. [2022-07-13 21:46:09,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 880 transitions. [2022-07-13 21:46:09,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:46:09,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 880 transitions. [2022-07-13 21:46:09,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 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-13 21:46:09,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 134.0) internal successors, (1206), 9 states have internal predecessors, (1206), 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-13 21:46:09,189 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 134.0) internal successors, (1206), 9 states have internal predecessors, (1206), 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-13 21:46:09,189 INFO L186 Difference]: Start difference. First operand has 206 places, 190 transitions, 1229 flow. Second operand 8 states and 880 transitions. [2022-07-13 21:46:09,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 231 transitions, 1783 flow [2022-07-13 21:46:09,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 231 transitions, 1540 flow, removed 56 selfloop flow, removed 19 redundant places. [2022-07-13 21:46:09,600 INFO L242 Difference]: Finished difference. Result has 197 places, 198 transitions, 1293 flow [2022-07-13 21:46:09,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1293, PETRI_PLACES=197, PETRI_TRANSITIONS=198} [2022-07-13 21:46:09,600 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 56 predicate places. [2022-07-13 21:46:09,600 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 198 transitions, 1293 flow [2022-07-13 21:46:09,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 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-13 21:46:09,601 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:46:09,601 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, 1, 1, 1, 1, 1, 1, 1, 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-13 21:46:09,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:46:09,601 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:46:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:46:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1186698110, now seen corresponding path program 2 times [2022-07-13 21:46:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:46:09,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399986243] [2022-07-13 21:46:09,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:46:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:46:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:46:09,715 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-13 21:46:09,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:46:09,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399986243] [2022-07-13 21:46:09,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399986243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:46:09,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:46:09,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:46:09,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109697517] [2022-07-13 21:46:09,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:46:09,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:46:09,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:46:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:46:09,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:46:09,718 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 134 [2022-07-13 21:46:09,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 198 transitions, 1293 flow. Second operand has 8 states, 8 states have (on average 105.375) internal successors, (843), 8 states have internal predecessors, (843), 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-13 21:46:09,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:46:09,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 134 [2022-07-13 21:46:09,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:46:10,525 INFO L129 PetriNetUnfolder]: 1739/7068 cut-off events. [2022-07-13 21:46:10,525 INFO L130 PetriNetUnfolder]: For 13079/13354 co-relation queries the response was YES. [2022-07-13 21:46:10,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20301 conditions, 7068 events. 1739/7068 cut-off events. For 13079/13354 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 90742 event pairs, 65 based on Foata normal form. 17/6720 useless extension candidates. Maximal degree in co-relation 20263. Up to 682 conditions per place. [2022-07-13 21:46:10,653 INFO L132 encePairwiseOnDemand]: 120/134 looper letters, 22 selfloop transitions, 10 changer transitions 64/230 dead transitions. [2022-07-13 21:46:10,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 230 transitions, 1706 flow [2022-07-13 21:46:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:46:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:46:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2022-07-13 21:46:10,655 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8167495854063018 [2022-07-13 21:46:10,656 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 985 transitions. [2022-07-13 21:46:10,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 985 transitions. [2022-07-13 21:46:10,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:46:10,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 985 transitions. [2022-07-13 21:46:10,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 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-13 21:46:10,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-13 21:46:10,659 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-13 21:46:10,660 INFO L186 Difference]: Start difference. First operand has 197 places, 198 transitions, 1293 flow. Second operand 9 states and 985 transitions. [2022-07-13 21:46:10,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 230 transitions, 1706 flow [2022-07-13 21:46:10,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 230 transitions, 1646 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-13 21:46:10,913 INFO L242 Difference]: Finished difference. Result has 200 places, 164 transitions, 870 flow [2022-07-13 21:46:10,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=870, PETRI_PLACES=200, PETRI_TRANSITIONS=164} [2022-07-13 21:46:10,914 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 59 predicate places. [2022-07-13 21:46:10,914 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 164 transitions, 870 flow [2022-07-13 21:46:10,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.375) internal successors, (843), 8 states have internal predecessors, (843), 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-13 21:46:10,915 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:46:10,915 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, 1, 1, 1, 1, 1, 1, 1, 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-13 21:46:10,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:46:10,915 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:46:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:46:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1374378554, now seen corresponding path program 3 times [2022-07-13 21:46:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:46:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665364276] [2022-07-13 21:46:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:46:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:46:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:46:11,196 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-13 21:46:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:46:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665364276] [2022-07-13 21:46:11,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665364276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:46:11,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:46:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 21:46:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286490265] [2022-07-13 21:46:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:46:11,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:46:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:46:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:46:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:46:11,199 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2022-07-13 21:46:11,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 164 transitions, 870 flow. Second operand has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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-13 21:46:11,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:46:11,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2022-07-13 21:46:11,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:46:11,506 INFO L129 PetriNetUnfolder]: 478/2342 cut-off events. [2022-07-13 21:46:11,506 INFO L130 PetriNetUnfolder]: For 4157/4211 co-relation queries the response was YES. [2022-07-13 21:46:11,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6631 conditions, 2342 events. 478/2342 cut-off events. For 4157/4211 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 25835 event pairs, 7 based on Foata normal form. 1/2248 useless extension candidates. Maximal degree in co-relation 6594. Up to 313 conditions per place. [2022-07-13 21:46:11,522 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 17 selfloop transitions, 8 changer transitions 46/170 dead transitions. [2022-07-13 21:46:11,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 170 transitions, 956 flow [2022-07-13 21:46:11,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:46:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:46:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1396 transitions. [2022-07-13 21:46:11,524 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.801377726750861 [2022-07-13 21:46:11,525 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1396 transitions. [2022-07-13 21:46:11,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1396 transitions. [2022-07-13 21:46:11,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:46:11,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1396 transitions. [2022-07-13 21:46:11,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 107.38461538461539) internal successors, (1396), 13 states have internal predecessors, (1396), 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-13 21:46:11,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:46:11,529 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-13 21:46:11,529 INFO L186 Difference]: Start difference. First operand has 200 places, 164 transitions, 870 flow. Second operand 13 states and 1396 transitions. [2022-07-13 21:46:11,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 170 transitions, 956 flow [2022-07-13 21:46:11,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 170 transitions, 850 flow, removed 10 selfloop flow, removed 19 redundant places. [2022-07-13 21:46:11,587 INFO L242 Difference]: Finished difference. Result has 194 places, 124 transitions, 472 flow [2022-07-13 21:46:11,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=472, PETRI_PLACES=194, PETRI_TRANSITIONS=124} [2022-07-13 21:46:11,588 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 53 predicate places. [2022-07-13 21:46:11,588 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 124 transitions, 472 flow [2022-07-13 21:46:11,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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-13 21:46:11,588 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:46:11,589 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, 1, 1, 1, 1, 1, 1, 1, 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-13 21:46:11,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:46:11,589 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:46:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:46:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -168265090, now seen corresponding path program 4 times [2022-07-13 21:46:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:46:11,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854574836] [2022-07-13 21:46:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:46:11,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:46:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:46:11,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:46:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:46:11,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:46:11,704 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:46:11,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-13 21:46:11,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-13 21:46:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-13 21:46:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-13 21:46:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-13 21:46:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-13 21:46:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-13 21:46:11,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:46:11,707 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:46:11,711 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:46:11,711 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:46:11,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:46:11 BasicIcfg [2022-07-13 21:46:11,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:46:11,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:46:11,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:46:11,868 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:46:11,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:45:31" (3/4) ... [2022-07-13 21:46:11,870 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:46:11,976 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:46:11,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:46:11,977 INFO L158 Benchmark]: Toolchain (without parser) took 42330.26ms. Allocated memory was 86.0MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 61.9MB in the beginning and 6.4GB in the end (delta: -6.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-07-13 21:46:11,977 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:46:11,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.06ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 61.6MB in the beginning and 72.0MB in the end (delta: -10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 21:46:11,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.51ms. Allocated memory is still 113.2MB. Free memory was 72.0MB in the beginning and 68.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:46:11,978 INFO L158 Benchmark]: Boogie Preprocessor took 35.52ms. Allocated memory is still 113.2MB. Free memory was 68.8MB in the beginning and 66.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:46:11,978 INFO L158 Benchmark]: RCFGBuilder took 925.93ms. Allocated memory is still 113.2MB. Free memory was 66.4MB in the beginning and 53.0MB in the end (delta: 13.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2022-07-13 21:46:11,978 INFO L158 Benchmark]: TraceAbstraction took 40700.98ms. Allocated memory was 113.2MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 53.0MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-07-13 21:46:11,979 INFO L158 Benchmark]: Witness Printer took 108.54ms. Allocated memory is still 8.5GB. Free memory was 6.5GB in the beginning and 6.4GB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-07-13 21:46:11,981 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.11ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.06ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 61.6MB in the beginning and 72.0MB in the end (delta: -10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.51ms. Allocated memory is still 113.2MB. Free memory was 72.0MB in the beginning and 68.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.52ms. Allocated memory is still 113.2MB. Free memory was 68.8MB in the beginning and 66.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 925.93ms. Allocated memory is still 113.2MB. Free memory was 66.4MB in the beginning and 53.0MB in the end (delta: 13.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40700.98ms. Allocated memory was 113.2MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 53.0MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 108.54ms. Allocated memory is still 8.5GB. Free memory was 6.5GB in the beginning and 6.4GB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t557; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t557, ((void *)0), P0, ((void *)0))=-3, t557={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t558; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t557={5:0}, t558={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t558, ((void *)0), P1, ((void *)0))=-2, t557={5:0}, t558={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t559; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t557={5:0}, t558={6:0}, t559={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t559, ((void *)0), P2, ((void *)0))=-1, t557={5:0}, t558={6:0}, t559={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t560; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t557={5:0}, t558={6:0}, t559={7:0}, t560={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t560, ((void *)0), P3, ((void *)0))=0, t557={5:0}, t558={6:0}, t559={7:0}, t560={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 z$flush_delayed = weak$$choice2 [L824] 4 z$mem_tmp = z [L825] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L825] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L826] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L827] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L828] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = z [L833] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L833] 4 z = z$flush_delayed ? z$mem_tmp : z [L834] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L841] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L842] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557={5:0}, t558={6:0}, t559={7:0}, t560={3:0}, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L875] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557={5:0}, t558={6:0}, t559={7:0}, t560={3:0}, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$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: 865]: 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: 869]: 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: 867]: 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: 863]: 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 9 procedures, 168 locations, 7 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: 40.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 38.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 891 mSDsluCounter, 991 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1597 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1817 IncrementalHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 210 mSDtfsCounter, 1817 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1631occurred in iteration=9, InterpolantAutomatonStates: 152, 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.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 5530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-13 21:46:12,012 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