./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:07:06,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:07:06,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:07:06,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:07:06,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:07:06,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:07:06,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:07:06,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:07:06,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:07:06,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:07:06,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:07:06,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:07:06,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:07:06,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:07:06,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:07:06,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:07:06,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:07:06,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:07:06,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:07:06,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:07:06,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:07:06,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:07:06,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:07:06,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:07:06,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:07:06,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:07:06,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:07:06,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:07:06,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:07:06,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:07:06,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:07:06,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:07:06,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:07:06,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:07:06,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:07:06,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:07:06,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:07:06,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:07:06,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:07:06,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:07:06,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:07:06,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:07:06,454 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:07:06,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:07:06,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:07:06,456 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:07:06,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:07:06,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:07:06,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:07:06,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:07:06,457 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:07:06,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:07:06,458 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:07:06,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:07:06,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:07:06,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:07:06,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:07:06,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:07:06,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:07:06,459 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:07:06,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:07:06,461 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:07:06,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:07:06,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:07:06,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:07:06,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:07:06,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:07:06,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:07:06,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:07:06,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:07:06,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:07:06,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:07:06,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:07:06,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:07:06,467 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:07:06,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:07:06,468 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:07:06,468 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:07:06,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:07:06,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:07:06,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:07:06,773 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:07:06,774 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:07:06,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2023-08-30 23:07:07,947 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:07:08,241 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:07:08,241 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2023-08-30 23:07:08,255 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424cebd03/54757f6dc7bb4af38c69d56228f299d7/FLAG63892cea4 [2023-08-30 23:07:08,271 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424cebd03/54757f6dc7bb4af38c69d56228f299d7 [2023-08-30 23:07:08,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:07:08,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:07:08,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:07:08,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:07:08,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:07:08,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b834b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08, skipping insertion in model container [2023-08-30 23:07:08,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:07:08,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:07:08,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i[949,962] [2023-08-30 23:07:08,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:07:08,725 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:07:08,737 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i[949,962] [2023-08-30 23:07:08,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:07:08,859 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:07:08,860 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:07:08,865 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:07:08,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08 WrapperNode [2023-08-30 23:07:08,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:07:08,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:07:08,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:07:08,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:07:08,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,956 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 264 [2023-08-30 23:07:08,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:07:08,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:07:08,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:07:08,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:07:08,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,996 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:08,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:09,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:07:09,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:07:09,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:07:09,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:07:09,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (1/1) ... [2023-08-30 23:07:09,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:07:09,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:07:09,032 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) [2023-08-30 23:07:09,036 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 [2023-08-30 23:07:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:07:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:07:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:07:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:07:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:07:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:07:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:07:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:07:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:07:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:07:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:07:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:07:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:07:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:07:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:07:09,073 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:07:09,217 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:07:09,219 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:07:09,680 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:07:09,902 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:07:09,902 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:07:09,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:07:09 BoogieIcfgContainer [2023-08-30 23:07:09,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:07:09,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:07:09,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:07:09,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:07:09,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:07:08" (1/3) ... [2023-08-30 23:07:09,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796703c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:07:09, skipping insertion in model container [2023-08-30 23:07:09,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:08" (2/3) ... [2023-08-30 23:07:09,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796703c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:07:09, skipping insertion in model container [2023-08-30 23:07:09,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:07:09" (3/3) ... [2023-08-30 23:07:09,913 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2023-08-30 23:07:09,919 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:07:09,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:07:09,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-30 23:07:09,928 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:07:09,989 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:07:10,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2023-08-30 23:07:10,088 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 23:07:10,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:07:10,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 23:07:10,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 129 transitions, 273 flow [2023-08-30 23:07:10,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 126 transitions, 261 flow [2023-08-30 23:07:10,104 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:07:10,112 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 261 flow [2023-08-30 23:07:10,114 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 261 flow [2023-08-30 23:07:10,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 261 flow [2023-08-30 23:07:10,139 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 23:07:10,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:07:10,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 23:07:10,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 2186 [2023-08-30 23:07:15,971 INFO L134 LiptonReduction]: Checked pairs total: 6720 [2023-08-30 23:07:15,972 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-30 23:07:15,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:07:15,989 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38ce99c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:07:15,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-08-30 23:07:15,993 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 23:07:15,993 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:07:15,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:15,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 23:07:15,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:15,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 668273212, now seen corresponding path program 1 times [2023-08-30 23:07:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:16,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162756531] [2023-08-30 23:07:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:16,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:16,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162756531] [2023-08-30 23:07:16,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162756531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:16,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:16,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:07:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959311933] [2023-08-30 23:07:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:16,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:07:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:07:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:07:16,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-08-30 23:07:16,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:16,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:16,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-08-30 23:07:16,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:17,001 INFO L130 PetriNetUnfolder]: 1679/2465 cut-off events. [2023-08-30 23:07:17,002 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-30 23:07:17,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4984 conditions, 2465 events. 1679/2465 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11644 event pairs, 339 based on Foata normal form. 0/2196 useless extension candidates. Maximal degree in co-relation 4973. Up to 2141 conditions per place. [2023-08-30 23:07:17,019 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-30 23:07:17,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 164 flow [2023-08-30 23:07:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:07:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:07:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-30 23:07:17,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027322404371585 [2023-08-30 23:07:17,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-30 23:07:17,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-30 23:07:17,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:17,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-30 23:07:17,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,056 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 61 flow. Second operand 3 states and 368 transitions. [2023-08-30 23:07:17,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 164 flow [2023-08-30 23:07:17,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:07:17,061 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 60 flow [2023-08-30 23:07:17,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-08-30 23:07:17,066 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-08-30 23:07:17,067 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2023-08-30 23:07:17,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:17,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:17,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:07:17,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:17,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2034441892, now seen corresponding path program 1 times [2023-08-30 23:07:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296914893] [2023-08-30 23:07:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296914893] [2023-08-30 23:07:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296914893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:17,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:17,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:07:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896773542] [2023-08-30 23:07:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:17,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:07:17,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:17,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:07:17,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:07:17,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-08-30 23:07:17,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:17,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-08-30 23:07:17,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:17,644 INFO L130 PetriNetUnfolder]: 1393/2171 cut-off events. [2023-08-30 23:07:17,644 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2023-08-30 23:07:17,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 2171 events. 1393/2171 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10769 event pairs, 249 based on Foata normal form. 0/2050 useless extension candidates. Maximal degree in co-relation 4381. Up to 1625 conditions per place. [2023-08-30 23:07:17,653 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 30 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-30 23:07:17,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2023-08-30 23:07:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:07:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:07:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-30 23:07:17,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49863387978142076 [2023-08-30 23:07:17,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-30 23:07:17,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-30 23:07:17,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:17,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-30 23:07:17,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,659 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 3 states and 365 transitions. [2023-08-30 23:07:17,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2023-08-30 23:07:17,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:07:17,661 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-08-30 23:07:17,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-30 23:07:17,661 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-08-30 23:07:17,662 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-08-30 23:07:17,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:17,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:17,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:07:17,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:17,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash -888499309, now seen corresponding path program 1 times [2023-08-30 23:07:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:17,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664841708] [2023-08-30 23:07:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664841708] [2023-08-30 23:07:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664841708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:07:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475287875] [2023-08-30 23:07:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:17,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:07:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:07:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:07:17,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-08-30 23:07:17,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:17,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:17,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-08-30 23:07:17,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:18,177 INFO L130 PetriNetUnfolder]: 1005/1519 cut-off events. [2023-08-30 23:07:18,177 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-30 23:07:18,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 1519 events. 1005/1519 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6828 event pairs, 293 based on Foata normal form. 40/1550 useless extension candidates. Maximal degree in co-relation 3161. Up to 1125 conditions per place. [2023-08-30 23:07:18,184 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 30 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-30 23:07:18,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 146 flow [2023-08-30 23:07:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:07:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:07:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-30 23:07:18,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959016393442623 [2023-08-30 23:07:18,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-30 23:07:18,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-30 23:07:18,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:18,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-30 23:07:18,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,190 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 363 transitions. [2023-08-30 23:07:18,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 146 flow [2023-08-30 23:07:18,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:07:18,192 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2023-08-30 23:07:18,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-30 23:07:18,193 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-08-30 23:07:18,196 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 60 flow [2023-08-30 23:07:18,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:18,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:18,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:07:18,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:18,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1132373175, now seen corresponding path program 1 times [2023-08-30 23:07:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528666938] [2023-08-30 23:07:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:18,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:18,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528666938] [2023-08-30 23:07:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528666938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:18,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:07:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710778514] [2023-08-30 23:07:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:18,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:07:18,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:07:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:07:18,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-08-30 23:07:18,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:18,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-08-30 23:07:18,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:18,810 INFO L130 PetriNetUnfolder]: 925/1463 cut-off events. [2023-08-30 23:07:18,811 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2023-08-30 23:07:18,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 1463 events. 925/1463 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6597 event pairs, 367 based on Foata normal form. 32/1494 useless extension candidates. Maximal degree in co-relation 3089. Up to 855 conditions per place. [2023-08-30 23:07:18,817 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-30 23:07:18,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 145 flow [2023-08-30 23:07:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:07:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:07:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 23:07:18,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49453551912568305 [2023-08-30 23:07:18,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 23:07:18,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 23:07:18,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:18,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 23:07:18,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,824 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 60 flow. Second operand 3 states and 362 transitions. [2023-08-30 23:07:18,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 145 flow [2023-08-30 23:07:18,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:07:18,826 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow [2023-08-30 23:07:18,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-30 23:07:18,828 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-08-30 23:07:18,828 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2023-08-30 23:07:18,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:18,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:18,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:07:18,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:18,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -919964878, now seen corresponding path program 1 times [2023-08-30 23:07:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923068470] [2023-08-30 23:07:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923068470] [2023-08-30 23:07:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923068470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:07:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334628205] [2023-08-30 23:07:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:19,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:07:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:19,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:07:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:07:19,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-08-30 23:07:19,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:19,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:19,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-08-30 23:07:19,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:19,575 INFO L130 PetriNetUnfolder]: 737/1209 cut-off events. [2023-08-30 23:07:19,575 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-08-30 23:07:19,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2713 conditions, 1209 events. 737/1209 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5753 event pairs, 257 based on Foata normal form. 120/1322 useless extension candidates. Maximal degree in co-relation 2701. Up to 413 conditions per place. [2023-08-30 23:07:19,579 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 44 selfloop transitions, 5 changer transitions 1/52 dead transitions. [2023-08-30 23:07:19,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 234 flow [2023-08-30 23:07:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:07:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:07:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-30 23:07:19,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48360655737704916 [2023-08-30 23:07:19,582 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-30 23:07:19,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-30 23:07:19,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:19,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-30 23:07:19,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:19,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:19,586 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:19,586 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 4 states and 472 transitions. [2023-08-30 23:07:19,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 234 flow [2023-08-30 23:07:19,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:07:19,588 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 94 flow [2023-08-30 23:07:19,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-08-30 23:07:19,589 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-30 23:07:19,589 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 94 flow [2023-08-30 23:07:19,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:19,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:19,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:19,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:07:19,590 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:19,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1685554105, now seen corresponding path program 1 times [2023-08-30 23:07:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633830806] [2023-08-30 23:07:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633830806] [2023-08-30 23:07:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633830806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:20,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:20,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:07:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736316476] [2023-08-30 23:07:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:20,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:07:20,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:20,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:07:20,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:07:20,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-08-30 23:07:20,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:20,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:20,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-08-30 23:07:20,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:20,286 INFO L130 PetriNetUnfolder]: 374/659 cut-off events. [2023-08-30 23:07:20,286 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-30 23:07:20,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 659 events. 374/659 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2823 event pairs, 122 based on Foata normal form. 60/715 useless extension candidates. Maximal degree in co-relation 1791. Up to 282 conditions per place. [2023-08-30 23:07:20,290 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 55 selfloop transitions, 8 changer transitions 1/66 dead transitions. [2023-08-30 23:07:20,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 329 flow [2023-08-30 23:07:20,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:07:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:07:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-08-30 23:07:20,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48442622950819675 [2023-08-30 23:07:20,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-08-30 23:07:20,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-08-30 23:07:20,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:20,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-08-30 23:07:20,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:20,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:20,297 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:20,298 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 94 flow. Second operand 5 states and 591 transitions. [2023-08-30 23:07:20,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 329 flow [2023-08-30 23:07:20,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 319 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:07:20,300 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 134 flow [2023-08-30 23:07:20,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-30 23:07:20,301 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-08-30 23:07:20,302 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 134 flow [2023-08-30 23:07:20,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:20,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:20,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:20,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:07:20,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:20,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:20,303 INFO L85 PathProgramCache]: Analyzing trace with hash 261368615, now seen corresponding path program 1 times [2023-08-30 23:07:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:20,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979279139] [2023-08-30 23:07:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979279139] [2023-08-30 23:07:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979279139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:07:20,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579988380] [2023-08-30 23:07:20,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:20,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:07:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:20,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:07:20,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:07:20,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-08-30 23:07:20,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:20,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:20,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-08-30 23:07:20,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:21,050 INFO L130 PetriNetUnfolder]: 260/466 cut-off events. [2023-08-30 23:07:21,050 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2023-08-30 23:07:21,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 466 events. 260/466 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1883 event pairs, 122 based on Foata normal form. 13/475 useless extension candidates. Maximal degree in co-relation 1347. Up to 219 conditions per place. [2023-08-30 23:07:21,053 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 40 selfloop transitions, 11 changer transitions 1/54 dead transitions. [2023-08-30 23:07:21,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 302 flow [2023-08-30 23:07:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:07:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:07:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 684 transitions. [2023-08-30 23:07:21,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672131147540984 [2023-08-30 23:07:21,056 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 684 transitions. [2023-08-30 23:07:21,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 684 transitions. [2023-08-30 23:07:21,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:21,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 684 transitions. [2023-08-30 23:07:21,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:21,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:21,061 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:21,061 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 134 flow. Second operand 6 states and 684 transitions. [2023-08-30 23:07:21,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 302 flow [2023-08-30 23:07:21,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 265 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-30 23:07:21,064 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 140 flow [2023-08-30 23:07:21,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-30 23:07:21,065 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 23:07:21,065 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 140 flow [2023-08-30 23:07:21,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:21,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:21,066 INFO L208 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] [2023-08-30 23:07:21,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:07:21,066 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:21,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2093713569, now seen corresponding path program 1 times [2023-08-30 23:07:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692016693] [2023-08-30 23:07:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692016693] [2023-08-30 23:07:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692016693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:07:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875846638] [2023-08-30 23:07:22,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:22,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:07:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:07:22,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:07:22,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 244 [2023-08-30 23:07:22,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 140 flow. Second operand has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:22,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:22,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 244 [2023-08-30 23:07:22,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:22,763 INFO L130 PetriNetUnfolder]: 475/815 cut-off events. [2023-08-30 23:07:22,764 INFO L131 PetriNetUnfolder]: For 751/751 co-relation queries the response was YES. [2023-08-30 23:07:22,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 815 events. 475/815 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3402 event pairs, 33 based on Foata normal form. 1/816 useless extension candidates. Maximal degree in co-relation 2266. Up to 449 conditions per place. [2023-08-30 23:07:22,767 INFO L137 encePairwiseOnDemand]: 236/244 looper letters, 51 selfloop transitions, 10 changer transitions 57/118 dead transitions. [2023-08-30 23:07:22,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 118 transitions, 770 flow [2023-08-30 23:07:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 23:07:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 23:07:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1273 transitions. [2023-08-30 23:07:22,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4347677595628415 [2023-08-30 23:07:22,772 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1273 transitions. [2023-08-30 23:07:22,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1273 transitions. [2023-08-30 23:07:22,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:22,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1273 transitions. [2023-08-30 23:07:22,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 106.08333333333333) internal successors, (1273), 12 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:22,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 244.0) internal successors, (3172), 13 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:22,782 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 244.0) internal successors, (3172), 13 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:22,782 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 140 flow. Second operand 12 states and 1273 transitions. [2023-08-30 23:07:22,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 118 transitions, 770 flow [2023-08-30 23:07:22,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 118 transitions, 566 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-30 23:07:22,788 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 153 flow [2023-08-30 23:07:22,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=153, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-30 23:07:22,791 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-08-30 23:07:22,791 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 153 flow [2023-08-30 23:07:22,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:22,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:22,792 INFO L208 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] [2023-08-30 23:07:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:07:22,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:22,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2065331839, now seen corresponding path program 2 times [2023-08-30 23:07:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792450448] [2023-08-30 23:07:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:24,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792450448] [2023-08-30 23:07:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792450448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:24,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:07:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863922901] [2023-08-30 23:07:24,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:24,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:07:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:24,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:07:24,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:07:24,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 244 [2023-08-30 23:07:24,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 153 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) [2023-08-30 23:07:24,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:24,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 244 [2023-08-30 23:07:24,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:24,569 INFO L130 PetriNetUnfolder]: 440/786 cut-off events. [2023-08-30 23:07:24,569 INFO L131 PetriNetUnfolder]: For 770/770 co-relation queries the response was YES. [2023-08-30 23:07:24,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 786 events. 440/786 cut-off events. For 770/770 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3571 event pairs, 64 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 2257. Up to 485 conditions per place. [2023-08-30 23:07:24,573 INFO L137 encePairwiseOnDemand]: 236/244 looper letters, 50 selfloop transitions, 12 changer transitions 11/73 dead transitions. [2023-08-30 23:07:24,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 437 flow [2023-08-30 23:07:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:07:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:07:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2023-08-30 23:07:24,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45550351288056207 [2023-08-30 23:07:24,576 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 778 transitions. [2023-08-30 23:07:24,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions. [2023-08-30 23:07:24,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:24,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions. [2023-08-30 23:07:24,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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) [2023-08-30 23:07:24,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:24,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:24,583 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 153 flow. Second operand 7 states and 778 transitions. [2023-08-30 23:07:24,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 437 flow [2023-08-30 23:07:24,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 419 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-30 23:07:24,587 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 202 flow [2023-08-30 23:07:24,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-30 23:07:24,588 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-08-30 23:07:24,588 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 202 flow [2023-08-30 23:07:24,588 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) [2023-08-30 23:07:24,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:24,589 INFO L208 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] [2023-08-30 23:07:24,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:07:24,589 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:24,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1584897619, now seen corresponding path program 3 times [2023-08-30 23:07:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:24,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536628039] [2023-08-30 23:07:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:26,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536628039] [2023-08-30 23:07:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536628039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:26,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:26,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:07:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206493328] [2023-08-30 23:07:26,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:26,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:07:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:26,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:07:26,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:07:26,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 244 [2023-08-30 23:07:26,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:26,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:26,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 244 [2023-08-30 23:07:26,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:26,782 INFO L130 PetriNetUnfolder]: 405/747 cut-off events. [2023-08-30 23:07:26,783 INFO L131 PetriNetUnfolder]: For 897/897 co-relation queries the response was YES. [2023-08-30 23:07:26,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 747 events. 405/747 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3433 event pairs, 79 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 2341. Up to 406 conditions per place. [2023-08-30 23:07:26,786 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 49 selfloop transitions, 13 changer transitions 12/74 dead transitions. [2023-08-30 23:07:26,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 468 flow [2023-08-30 23:07:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:07:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:07:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions. [2023-08-30 23:07:26,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344262295081967 [2023-08-30 23:07:26,790 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 742 transitions. [2023-08-30 23:07:26,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions. [2023-08-30 23:07:26,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:26,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions. [2023-08-30 23:07:26,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:26,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:26,795 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:26,795 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 202 flow. Second operand 7 states and 742 transitions. [2023-08-30 23:07:26,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 468 flow [2023-08-30 23:07:26,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 454 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 23:07:26,800 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 233 flow [2023-08-30 23:07:26,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-08-30 23:07:26,801 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-08-30 23:07:26,801 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 233 flow [2023-08-30 23:07:26,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:07:26,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:26,802 INFO L208 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] [2023-08-30 23:07:26,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:07:26,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-30 23:07:26,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1377814885, now seen corresponding path program 4 times [2023-08-30 23:07:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184848629] [2023-08-30 23:07:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:07:26,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:07:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:07:27,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:07:27,104 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:07:27,105 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-08-30 23:07:27,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-08-30 23:07:27,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-08-30 23:07:27,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2023-08-30 23:07:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2023-08-30 23:07:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2023-08-30 23:07:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2023-08-30 23:07:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2023-08-30 23:07:27,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:07:27,109 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:27,113 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:07:27,113 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:07:27,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:07:27 BasicIcfg [2023-08-30 23:07:27,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:07:27,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:07:27,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:07:27,224 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:07:27,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:07:09" (3/4) ... [2023-08-30 23:07:27,226 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:07:27,322 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:07:27,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:07:27,323 INFO L158 Benchmark]: Toolchain (without parser) took 19048.85ms. Allocated memory was 69.2MB in the beginning and 474.0MB in the end (delta: 404.8MB). Free memory was 44.5MB in the beginning and 382.0MB in the end (delta: -337.5MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2023-08-30 23:07:27,323 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:07:27,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.21ms. Allocated memory is still 69.2MB. Free memory was 44.3MB in the beginning and 33.4MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 23:07:27,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.80ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.1MB in the beginning and 60.7MB in the end (delta: -27.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2023-08-30 23:07:27,324 INFO L158 Benchmark]: Boogie Preprocessor took 44.81ms. Allocated memory is still 83.9MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:07:27,325 INFO L158 Benchmark]: RCFGBuilder took 902.94ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 37.3MB in the end (delta: 20.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2023-08-30 23:07:27,325 INFO L158 Benchmark]: TraceAbstraction took 17315.50ms. Allocated memory was 83.9MB in the beginning and 474.0MB in the end (delta: 390.1MB). Free memory was 36.2MB in the beginning and 398.8MB in the end (delta: -362.5MB). Peak memory consumption was 228.5MB. Max. memory is 16.1GB. [2023-08-30 23:07:27,325 INFO L158 Benchmark]: Witness Printer took 99.05ms. Allocated memory is still 474.0MB. Free memory was 398.8MB in the beginning and 382.0MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:07:27,327 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.17ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.21ms. Allocated memory is still 69.2MB. Free memory was 44.3MB in the beginning and 33.4MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.80ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.1MB in the beginning and 60.7MB in the end (delta: -27.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.81ms. Allocated memory is still 83.9MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 902.94ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 37.3MB in the end (delta: 20.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17315.50ms. Allocated memory was 83.9MB in the beginning and 474.0MB in the end (delta: 390.1MB). Free memory was 36.2MB in the beginning and 398.8MB in the end (delta: -362.5MB). Peak memory consumption was 228.5MB. Max. memory is 16.1GB. * Witness Printer took 99.05ms. Allocated memory is still 474.0MB. Free memory was 398.8MB in the beginning and 382.0MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 134 PlacesBefore, 36 PlacesAfterwards, 126 TransitionsBefore, 26 TransitionsAfterwards, 2186 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 6720 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2389, independent: 2174, independent conditional: 0, independent unconditional: 2174, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1182, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2389, independent: 1037, independent conditional: 0, independent unconditional: 1037, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1182, unknown conditional: 0, unknown unconditional: 1182] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff1_thd0; [L747] 0 _Bool y$r_buff1_thd1; [L748] 0 _Bool y$r_buff1_thd2; [L749] 0 _Bool y$r_buff1_thd3; [L750] 0 _Bool y$read_delayed; [L751] 0 int *y$read_delayed_var; [L752] 0 int y$w_buff0; [L753] 0 _Bool y$w_buff0_used; [L754] 0 int y$w_buff1; [L755] 0 _Bool y$w_buff1_used; [L757] 0 int z = 0; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice2; [L899] 0 pthread_t t171; [L900] FCALL, FORK 0 pthread_create(&t171, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t171, ((void *)0), P0, ((void *)0))=7, t171={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L901] 0 pthread_t t172; [L902] FCALL, FORK 0 pthread_create(&t172, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t172, ((void *)0), P1, ((void *)0))=8, t171={5:0}, t172={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L903] 0 pthread_t t173; [L904] FCALL, FORK 0 pthread_create(&t173, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t173, ((void *)0), P2, ((void *)0))=9, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L841] 3 y$w_buff1 = y$w_buff0 [L842] 3 y$w_buff0 = 1 [L843] 3 y$w_buff1_used = y$w_buff0_used [L844] 3 y$w_buff0_used = (_Bool)1 [L845] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L845] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L846] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L847] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L848] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L849] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L850] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 2 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L787] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L787] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 2 x$flush_delayed = weak$$choice2 [L798] 2 x$mem_tmp = x [L799] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L800] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L801] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L802] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L803] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L805] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 __unbuffered_p1_EAX = x [L807] 2 x = x$flush_delayed ? x$mem_tmp : x [L808] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] 2 y$mem_tmp = y [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L821] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L822] 2 __unbuffered_p1_EBX = y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 3 y$flush_delayed = weak$$choice2 [L856] 3 y$mem_tmp = y [L857] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L858] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L859] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L860] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L861] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L862] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L863] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L864] 3 __unbuffered_p2_EAX = y [L865] 3 y = y$flush_delayed ? y$mem_tmp : y [L866] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=0] [L869] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=0] [L763] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L827] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L828] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L829] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L830] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L831] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L834] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 2 return 0; [L872] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L873] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L874] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L875] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L876] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L877] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L878] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L879] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L880] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L881] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L884] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L886] 3 return 0; [L906] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L908] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L908] RET 0 assume_abort_if_not(main$tmp_guard0) [L910] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L911] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L912] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L913] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L914] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L915] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L916] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L917] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L918] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L919] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L922] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L923] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L924] 0 x$flush_delayed = weak$$choice2 [L925] 0 x$mem_tmp = x [L926] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L927] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L928] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L929] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L930] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L931] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L932] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L933] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L934] 0 x = x$flush_delayed ? x$mem_tmp : x [L935] 0 x$flush_delayed = (_Bool)0 [L937] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - 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: 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: 900]: 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: 902]: 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: 904]: 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 7 procedures, 159 locations, 8 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: 17.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 523 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 944 IncrementalHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 69 mSDtfsCounter, 944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=10, InterpolantAutomatonStates: 53, 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.8s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:07:27,352 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