./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix053_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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 02:49:37,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 02:49:37,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 02:49:37,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 02:49:37,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 02:49:37,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 02:49:37,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 02:49:37,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 02:49:37,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 02:49:37,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 02:49:37,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 02:49:37,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 02:49:37,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 02:49:37,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 02:49:37,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 02:49:37,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 02:49:37,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 02:49:37,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 02:49:37,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 02:49:37,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 02:49:37,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 02:49:37,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 02:49:37,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 02:49:37,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 02:49:37,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 02:49:37,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 02:49:37,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 02:49:37,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 02:49:37,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 02:49:37,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 02:49:37,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 02:49:37,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 02:49:37,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 02:49:37,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 02:49:37,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 02:49:37,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 02:49:37,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 02:49:37,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 02:49:37,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 02:49:37,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 02:49:37,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 02:49:37,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 02:49:37,602 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 02:49:37,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 02:49:37,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 02:49:37,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 02:49:37,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 02:49:37,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 02:49:37,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 02:49:37,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 02:49:37,606 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 02:49:37,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 02:49:37,607 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 02:49:37,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 02:49:37,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 02:49:37,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 02:49:37,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 02:49:37,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 02:49:37,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 02:49:37,608 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 02:49:37,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 02:49:37,608 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 02:49:37,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 02:49:37,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 02:49:37,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 02:49:37,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 02:49:37,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:49:37,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 02:49:37,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 02:49:37,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 02:49:37,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 02:49:37,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 02:49:37,610 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 02:49:37,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 02:49:37,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 02:49:37,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2021-12-28 02:49:37,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 02:49:37,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 02:49:37,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 02:49:37,894 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 02:49:37,895 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 02:49:37,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2021-12-28 02:49:37,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc18a052a/292b2442d8d54c18b9f6e938d9c1669d/FLAGc17456a9a [2021-12-28 02:49:38,349 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 02:49:38,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2021-12-28 02:49:38,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc18a052a/292b2442d8d54c18b9f6e938d9c1669d/FLAGc17456a9a [2021-12-28 02:49:38,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc18a052a/292b2442d8d54c18b9f6e938d9c1669d [2021-12-28 02:49:38,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 02:49:38,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 02:49:38,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 02:49:38,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 02:49:38,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 02:49:38,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:49:38" (1/1) ... [2021-12-28 02:49:38,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee2e3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:38, skipping insertion in model container [2021-12-28 02:49:38,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:49:38" (1/1) ... [2021-12-28 02:49:38,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 02:49:38,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 02:49:38,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2021-12-28 02:49:39,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:49:39,092 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 02:49:39,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2021-12-28 02:49:39,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:49:39,183 INFO L208 MainTranslator]: Completed translation [2021-12-28 02:49:39,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39 WrapperNode [2021-12-28 02:49:39,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 02:49:39,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 02:49:39,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 02:49:39,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 02:49:39,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,283 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2021-12-28 02:49:39,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 02:49:39,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 02:49:39,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 02:49:39,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 02:49:39,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 02:49:39,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 02:49:39,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 02:49:39,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 02:49:39,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (1/1) ... [2021-12-28 02:49:39,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:49:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 02:49:39,363 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) [2021-12-28 02:49:39,381 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 [2021-12-28 02:49:39,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 02:49:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 02:49:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 02:49:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 02:49:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 02:49:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-28 02:49:39,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-28 02:49:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-28 02:49:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-28 02:49:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-28 02:49:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-28 02:49:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-28 02:49:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-28 02:49:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 02:49:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 02:49:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 02:49:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 02:49:39,394 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 02:49:39,490 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 02:49:39,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 02:49:39,911 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 02:49:40,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 02:49:40,176 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 02:49:40,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:49:40 BoogieIcfgContainer [2021-12-28 02:49:40,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 02:49:40,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 02:49:40,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 02:49:40,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 02:49:40,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:49:38" (1/3) ... [2021-12-28 02:49:40,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3814f84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:49:40, skipping insertion in model container [2021-12-28 02:49:40,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:39" (2/3) ... [2021-12-28 02:49:40,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3814f84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:49:40, skipping insertion in model container [2021-12-28 02:49:40,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:49:40" (3/3) ... [2021-12-28 02:49:40,185 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2021-12-28 02:49:40,189 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 02:49:40,189 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 02:49:40,189 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 02:49:40,189 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 02:49:40,228 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,228 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,228 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,229 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,229 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,229 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,229 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,229 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,230 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,230 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,231 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,231 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,232 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,232 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,232 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,232 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,233 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,233 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,233 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,237 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,237 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,237 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,237 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,238 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,238 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,238 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,238 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,238 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,239 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,239 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,239 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,239 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,239 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,239 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,240 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,240 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,240 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,240 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,240 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,241 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,241 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,241 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,241 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,242 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,242 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,242 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,243 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,243 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,243 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,243 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,243 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,243 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,244 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,245 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,245 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,245 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,245 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,245 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,245 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,246 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,247 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,248 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,249 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,249 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,249 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,250 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,250 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,250 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,250 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,251 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,254 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,254 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,255 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,255 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,255 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,255 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,256 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,256 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,256 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,256 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,259 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,259 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,259 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,260 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,260 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,261 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,261 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,261 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,261 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,261 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,261 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,261 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,262 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,262 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,262 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,262 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,263 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,263 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,263 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,263 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,263 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,263 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:40,266 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-28 02:49:40,298 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 02:49:40,303 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 02:49:40,303 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-28 02:49:40,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2021-12-28 02:49:40,363 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2021-12-28 02:49:40,363 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:49:40,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2021-12-28 02:49:40,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2021-12-28 02:49:40,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2021-12-28 02:49:40,407 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2021-12-28 02:49:40,407 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:49:40,407 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:40,408 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:40,408 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1118078414, now seen corresponding path program 1 times [2021-12-28 02:49:40,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:40,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107218470] [2021-12-28 02:49:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:40,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:40,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:40,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107218470] [2021-12-28 02:49:40,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107218470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:40,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:40,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 02:49:40,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438285443] [2021-12-28 02:49:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:40,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 02:49:40,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:40,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 02:49:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 02:49:40,691 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2021-12-28 02:49:40,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 3 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) [2021-12-28 02:49:40,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:40,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2021-12-28 02:49:40,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:40,851 INFO L129 PetriNetUnfolder]: 57/522 cut-off events. [2021-12-28 02:49:40,851 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-28 02:49:40,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 522 events. 57/522 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2652 event pairs, 31 based on Foata normal form. 15/507 useless extension candidates. Maximal degree in co-relation 595. Up to 75 conditions per place. [2021-12-28 02:49:40,856 INFO L132 encePairwiseOnDemand]: 129/134 looper letters, 14 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2021-12-28 02:49:40,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 131 transitions, 309 flow [2021-12-28 02:49:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 02:49:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 02:49:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2021-12-28 02:49:40,865 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2021-12-28 02:49:40,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2021-12-28 02:49:40,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2021-12-28 02:49:40,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:40,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2021-12-28 02:49:40,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2021-12-28 02:49:40,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:40,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:40,876 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 3 states and 378 transitions. [2021-12-28 02:49:40,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 131 transitions, 309 flow [2021-12-28 02:49:40,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:40,881 INFO L242 Difference]: Finished difference. Result has 137 places, 126 transitions, 264 flow [2021-12-28 02:49:40,882 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2021-12-28 02:49:40,885 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, -4 predicate places. [2021-12-28 02:49:40,885 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 264 flow [2021-12-28 02:49:40,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2021-12-28 02:49:40,885 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:40,885 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:40,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 02:49:40,886 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1709840169, now seen corresponding path program 1 times [2021-12-28 02:49:40,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:40,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116810409] [2021-12-28 02:49:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:40,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:41,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:41,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116810409] [2021-12-28 02:49:41,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116810409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:41,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:41,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:41,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818834797] [2021-12-28 02:49:41,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:41,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:41,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:41,122 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2021-12-28 02:49:41,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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) [2021-12-28 02:49:41,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:41,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2021-12-28 02:49:41,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:41,633 INFO L129 PetriNetUnfolder]: 954/2701 cut-off events. [2021-12-28 02:49:41,633 INFO L130 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2021-12-28 02:49:41,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 2701 events. 954/2701 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 21810 event pairs, 125 based on Foata normal form. 0/2632 useless extension candidates. Maximal degree in co-relation 4268. Up to 816 conditions per place. [2021-12-28 02:49:41,646 INFO L132 encePairwiseOnDemand]: 127/134 looper letters, 24 selfloop transitions, 3 changer transitions 56/177 dead transitions. [2021-12-28 02:49:41,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 177 transitions, 526 flow [2021-12-28 02:49:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2021-12-28 02:49:41,650 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2021-12-28 02:49:41,651 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2021-12-28 02:49:41,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2021-12-28 02:49:41,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:41,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2021-12-28 02:49:41,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 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) [2021-12-28 02:49:41,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:41,657 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:41,657 INFO L186 Difference]: Start difference. First operand has 137 places, 126 transitions, 264 flow. Second operand 9 states and 1071 transitions. [2021-12-28 02:49:41,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 177 transitions, 526 flow [2021-12-28 02:49:41,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 177 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-28 02:49:41,660 INFO L242 Difference]: Finished difference. Result has 150 places, 114 transitions, 275 flow [2021-12-28 02:49:41,660 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=150, PETRI_TRANSITIONS=114} [2021-12-28 02:49:41,661 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 9 predicate places. [2021-12-28 02:49:41,661 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 114 transitions, 275 flow [2021-12-28 02:49:41,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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) [2021-12-28 02:49:41,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:41,662 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:41,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 02:49:41,662 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1673744296, now seen corresponding path program 1 times [2021-12-28 02:49:41,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:41,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842446715] [2021-12-28 02:49:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:41,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:41,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:41,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842446715] [2021-12-28 02:49:41,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842446715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:41,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:41,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 02:49:41,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382678917] [2021-12-28 02:49:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:41,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 02:49:41,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 02:49:41,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-28 02:49:41,843 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2021-12-28 02:49:41,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 114 transitions, 275 flow. Second operand has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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) [2021-12-28 02:49:41,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:41,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2021-12-28 02:49:41,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:42,307 INFO L129 PetriNetUnfolder]: 796/1593 cut-off events. [2021-12-28 02:49:42,307 INFO L130 PetriNetUnfolder]: For 1323/1334 co-relation queries the response was YES. [2021-12-28 02:49:42,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 1593 events. 796/1593 cut-off events. For 1323/1334 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10377 event pairs, 201 based on Foata normal form. 45/1563 useless extension candidates. Maximal degree in co-relation 3675. Up to 661 conditions per place. [2021-12-28 02:49:42,320 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 21 selfloop transitions, 11 changer transitions 43/169 dead transitions. [2021-12-28 02:49:42,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 169 transitions, 569 flow [2021-12-28 02:49:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 02:49:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-28 02:49:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1713 transitions. [2021-12-28 02:49:42,324 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8522388059701492 [2021-12-28 02:49:42,324 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1713 transitions. [2021-12-28 02:49:42,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1713 transitions. [2021-12-28 02:49:42,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:42,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1713 transitions. [2021-12-28 02:49:42,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.2) internal successors, (1713), 15 states have internal predecessors, (1713), 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) [2021-12-28 02:49:42,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 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) [2021-12-28 02:49:42,332 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 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) [2021-12-28 02:49:42,332 INFO L186 Difference]: Start difference. First operand has 150 places, 114 transitions, 275 flow. Second operand 15 states and 1713 transitions. [2021-12-28 02:49:42,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 169 transitions, 569 flow [2021-12-28 02:49:42,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 169 transitions, 548 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:42,338 INFO L242 Difference]: Finished difference. Result has 151 places, 121 transitions, 365 flow [2021-12-28 02:49:42,339 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=365, PETRI_PLACES=151, PETRI_TRANSITIONS=121} [2021-12-28 02:49:42,339 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 10 predicate places. [2021-12-28 02:49:42,339 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 121 transitions, 365 flow [2021-12-28 02:49:42,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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) [2021-12-28 02:49:42,340 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:42,340 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:42,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 02:49:42,341 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:42,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1604978853, now seen corresponding path program 1 times [2021-12-28 02:49:42,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:42,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113561168] [2021-12-28 02:49:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:42,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:42,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:42,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113561168] [2021-12-28 02:49:42,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113561168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:42,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:42,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:49:42,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153079009] [2021-12-28 02:49:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:42,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:49:42,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:49:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:49:42,500 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2021-12-28 02:49:42,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 121 transitions, 365 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 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) [2021-12-28 02:49:42,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:42,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2021-12-28 02:49:42,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:42,999 INFO L129 PetriNetUnfolder]: 686/1552 cut-off events. [2021-12-28 02:49:43,000 INFO L130 PetriNetUnfolder]: For 4979/5093 co-relation queries the response was YES. [2021-12-28 02:49:43,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1552 events. 686/1552 cut-off events. For 4979/5093 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9976 event pairs, 160 based on Foata normal form. 29/1507 useless extension candidates. Maximal degree in co-relation 5409. Up to 544 conditions per place. [2021-12-28 02:49:43,017 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 32 selfloop transitions, 9 changer transitions 37/173 dead transitions. [2021-12-28 02:49:43,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 173 transitions, 887 flow [2021-12-28 02:49:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 02:49:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-28 02:49:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1615 transitions. [2021-12-28 02:49:43,020 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8608742004264393 [2021-12-28 02:49:43,020 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1615 transitions. [2021-12-28 02:49:43,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1615 transitions. [2021-12-28 02:49:43,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:43,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1615 transitions. [2021-12-28 02:49:43,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.35714285714286) internal successors, (1615), 14 states have internal predecessors, (1615), 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) [2021-12-28 02:49:43,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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) [2021-12-28 02:49:43,026 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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) [2021-12-28 02:49:43,026 INFO L186 Difference]: Start difference. First operand has 151 places, 121 transitions, 365 flow. Second operand 14 states and 1615 transitions. [2021-12-28 02:49:43,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 173 transitions, 887 flow [2021-12-28 02:49:43,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 173 transitions, 859 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-12-28 02:49:43,033 INFO L242 Difference]: Finished difference. Result has 160 places, 125 transitions, 442 flow [2021-12-28 02:49:43,033 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=442, PETRI_PLACES=160, PETRI_TRANSITIONS=125} [2021-12-28 02:49:43,034 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 19 predicate places. [2021-12-28 02:49:43,034 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 125 transitions, 442 flow [2021-12-28 02:49:43,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 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) [2021-12-28 02:49:43,034 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:43,035 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:43,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 02:49:43,035 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash 535024791, now seen corresponding path program 2 times [2021-12-28 02:49:43,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:43,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561365348] [2021-12-28 02:49:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:43,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:43,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:43,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561365348] [2021-12-28 02:49:43,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561365348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:43,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:43,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 02:49:43,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371155467] [2021-12-28 02:49:43,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:43,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 02:49:43,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 02:49:43,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-28 02:49:43,169 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2021-12-28 02:49:43,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 125 transitions, 442 flow. Second operand has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 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) [2021-12-28 02:49:43,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:43,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2021-12-28 02:49:43,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:43,627 INFO L129 PetriNetUnfolder]: 654/1494 cut-off events. [2021-12-28 02:49:43,627 INFO L130 PetriNetUnfolder]: For 10503/10661 co-relation queries the response was YES. [2021-12-28 02:49:43,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6945 conditions, 1494 events. 654/1494 cut-off events. For 10503/10661 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9561 event pairs, 146 based on Foata normal form. 40/1460 useless extension candidates. Maximal degree in co-relation 6859. Up to 536 conditions per place. [2021-12-28 02:49:43,646 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 33 selfloop transitions, 12 changer transitions 37/176 dead transitions. [2021-12-28 02:49:43,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 176 transitions, 1200 flow [2021-12-28 02:49:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 02:49:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-28 02:49:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1711 transitions. [2021-12-28 02:49:43,650 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8512437810945274 [2021-12-28 02:49:43,650 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1711 transitions. [2021-12-28 02:49:43,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1711 transitions. [2021-12-28 02:49:43,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:43,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1711 transitions. [2021-12-28 02:49:43,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.06666666666666) internal successors, (1711), 15 states have internal predecessors, (1711), 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) [2021-12-28 02:49:43,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 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) [2021-12-28 02:49:43,656 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 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) [2021-12-28 02:49:43,656 INFO L186 Difference]: Start difference. First operand has 160 places, 125 transitions, 442 flow. Second operand 15 states and 1711 transitions. [2021-12-28 02:49:43,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 176 transitions, 1200 flow [2021-12-28 02:49:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 176 transitions, 1121 flow, removed 33 selfloop flow, removed 8 redundant places. [2021-12-28 02:49:43,709 INFO L242 Difference]: Finished difference. Result has 167 places, 128 transitions, 512 flow [2021-12-28 02:49:43,710 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=512, PETRI_PLACES=167, PETRI_TRANSITIONS=128} [2021-12-28 02:49:43,710 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 26 predicate places. [2021-12-28 02:49:43,710 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 128 transitions, 512 flow [2021-12-28 02:49:43,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 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) [2021-12-28 02:49:43,711 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:43,712 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:43,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 02:49:43,712 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 356554085, now seen corresponding path program 1 times [2021-12-28 02:49:43,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:43,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474880990] [2021-12-28 02:49:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:43,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:43,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:43,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474880990] [2021-12-28 02:49:43,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474880990] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:43,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:43,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 02:49:43,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457819147] [2021-12-28 02:49:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:43,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 02:49:43,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 02:49:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-28 02:49:43,923 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 134 [2021-12-28 02:49:43,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 128 transitions, 512 flow. Second operand has 13 states, 13 states have (on average 108.46153846153847) internal successors, (1410), 13 states have internal predecessors, (1410), 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) [2021-12-28 02:49:43,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:43,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 134 [2021-12-28 02:49:43,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:44,431 INFO L129 PetriNetUnfolder]: 520/1238 cut-off events. [2021-12-28 02:49:44,431 INFO L130 PetriNetUnfolder]: For 13899/14147 co-relation queries the response was YES. [2021-12-28 02:49:44,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6517 conditions, 1238 events. 520/1238 cut-off events. For 13899/14147 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7885 event pairs, 138 based on Foata normal form. 23/1189 useless extension candidates. Maximal degree in co-relation 6423. Up to 530 conditions per place. [2021-12-28 02:49:44,449 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 36 selfloop transitions, 14 changer transitions 25/167 dead transitions. [2021-12-28 02:49:44,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 1209 flow [2021-12-28 02:49:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 02:49:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-28 02:49:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1885 transitions. [2021-12-28 02:49:44,453 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8274802458296752 [2021-12-28 02:49:44,453 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1885 transitions. [2021-12-28 02:49:44,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1885 transitions. [2021-12-28 02:49:44,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:44,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1885 transitions. [2021-12-28 02:49:44,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 110.88235294117646) internal successors, (1885), 17 states have internal predecessors, (1885), 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) [2021-12-28 02:49:44,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 134.0) internal successors, (2412), 18 states have internal predecessors, (2412), 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) [2021-12-28 02:49:44,460 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 134.0) internal successors, (2412), 18 states have internal predecessors, (2412), 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) [2021-12-28 02:49:44,460 INFO L186 Difference]: Start difference. First operand has 167 places, 128 transitions, 512 flow. Second operand 17 states and 1885 transitions. [2021-12-28 02:49:44,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 1209 flow [2021-12-28 02:49:44,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 167 transitions, 1027 flow, removed 83 selfloop flow, removed 12 redundant places. [2021-12-28 02:49:44,473 INFO L242 Difference]: Finished difference. Result has 172 places, 130 transitions, 540 flow [2021-12-28 02:49:44,473 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=540, PETRI_PLACES=172, PETRI_TRANSITIONS=130} [2021-12-28 02:49:44,475 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 31 predicate places. [2021-12-28 02:49:44,475 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 130 transitions, 540 flow [2021-12-28 02:49:44,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.46153846153847) internal successors, (1410), 13 states have internal predecessors, (1410), 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) [2021-12-28 02:49:44,476 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:44,476 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:44,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 02:49:44,476 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1902008150, now seen corresponding path program 1 times [2021-12-28 02:49:44,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:44,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034392337] [2021-12-28 02:49:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:44,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:44,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:44,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034392337] [2021-12-28 02:49:44,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034392337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:44,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:44,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 02:49:44,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069331160] [2021-12-28 02:49:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:44,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 02:49:44,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 02:49:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-28 02:49:44,681 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2021-12-28 02:49:44,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 130 transitions, 540 flow. Second operand has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 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) [2021-12-28 02:49:44,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:44,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2021-12-28 02:49:44,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:45,020 INFO L129 PetriNetUnfolder]: 606/1332 cut-off events. [2021-12-28 02:49:45,020 INFO L130 PetriNetUnfolder]: For 16130/16591 co-relation queries the response was YES. [2021-12-28 02:49:45,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7247 conditions, 1332 events. 606/1332 cut-off events. For 16130/16591 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8453 event pairs, 69 based on Foata normal form. 48/1310 useless extension candidates. Maximal degree in co-relation 7151. Up to 566 conditions per place. [2021-12-28 02:49:45,036 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 31 selfloop transitions, 12 changer transitions 29/166 dead transitions. [2021-12-28 02:49:45,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 1142 flow [2021-12-28 02:49:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1478 transitions. [2021-12-28 02:49:45,039 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8484500574052812 [2021-12-28 02:49:45,039 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1478 transitions. [2021-12-28 02:49:45,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1478 transitions. [2021-12-28 02:49:45,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:45,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1478 transitions. [2021-12-28 02:49:45,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.6923076923077) internal successors, (1478), 13 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:45,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:45,044 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:45,044 INFO L186 Difference]: Start difference. First operand has 172 places, 130 transitions, 540 flow. Second operand 13 states and 1478 transitions. [2021-12-28 02:49:45,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 1142 flow [2021-12-28 02:49:45,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 166 transitions, 1012 flow, removed 58 selfloop flow, removed 14 redundant places. [2021-12-28 02:49:45,061 INFO L242 Difference]: Finished difference. Result has 168 places, 132 transitions, 580 flow [2021-12-28 02:49:45,061 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=580, PETRI_PLACES=168, PETRI_TRANSITIONS=132} [2021-12-28 02:49:45,062 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 27 predicate places. [2021-12-28 02:49:45,062 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 132 transitions, 580 flow [2021-12-28 02:49:45,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 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) [2021-12-28 02:49:45,063 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:45,063 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:45,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 02:49:45,063 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -191689699, now seen corresponding path program 1 times [2021-12-28 02:49:45,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115007867] [2021-12-28 02:49:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:45,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:45,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:45,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115007867] [2021-12-28 02:49:45,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115007867] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:45,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:45,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:49:45,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146388963] [2021-12-28 02:49:45,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:45,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:49:45,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:45,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:49:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:49:45,215 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2021-12-28 02:49:45,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 132 transitions, 580 flow. Second operand has 9 states, 9 states have (on average 110.88888888888889) internal successors, (998), 9 states have internal predecessors, (998), 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) [2021-12-28 02:49:45,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:45,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2021-12-28 02:49:45,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:45,584 INFO L129 PetriNetUnfolder]: 528/1282 cut-off events. [2021-12-28 02:49:45,584 INFO L130 PetriNetUnfolder]: For 16509/16796 co-relation queries the response was YES. [2021-12-28 02:49:45,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7177 conditions, 1282 events. 528/1282 cut-off events. For 16509/16796 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7977 event pairs, 107 based on Foata normal form. 59/1281 useless extension candidates. Maximal degree in co-relation 7083. Up to 499 conditions per place. [2021-12-28 02:49:45,599 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 39 selfloop transitions, 15 changer transitions 13/161 dead transitions. [2021-12-28 02:49:45,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 161 transitions, 1130 flow [2021-12-28 02:49:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1036 transitions. [2021-12-28 02:49:45,602 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8590381426202321 [2021-12-28 02:49:45,602 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1036 transitions. [2021-12-28 02:49:45,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1036 transitions. [2021-12-28 02:49:45,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:45,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1036 transitions. [2021-12-28 02:49:45,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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) [2021-12-28 02:49:45,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:45,605 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:45,605 INFO L186 Difference]: Start difference. First operand has 168 places, 132 transitions, 580 flow. Second operand 9 states and 1036 transitions. [2021-12-28 02:49:45,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 161 transitions, 1130 flow [2021-12-28 02:49:45,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 1073 flow, removed 20 selfloop flow, removed 8 redundant places. [2021-12-28 02:49:45,614 INFO L242 Difference]: Finished difference. Result has 166 places, 136 transitions, 650 flow [2021-12-28 02:49:45,615 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=650, PETRI_PLACES=166, PETRI_TRANSITIONS=136} [2021-12-28 02:49:45,615 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 25 predicate places. [2021-12-28 02:49:45,615 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 136 transitions, 650 flow [2021-12-28 02:49:45,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.88888888888889) internal successors, (998), 9 states have internal predecessors, (998), 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) [2021-12-28 02:49:45,616 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:45,616 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:45,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 02:49:45,616 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1157214247, now seen corresponding path program 2 times [2021-12-28 02:49:45,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:45,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144292667] [2021-12-28 02:49:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:45,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:45,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:45,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144292667] [2021-12-28 02:49:45,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144292667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:45,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:45,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 02:49:45,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457657026] [2021-12-28 02:49:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:45,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 02:49:45,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:45,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 02:49:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-28 02:49:45,750 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:49:45,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 136 transitions, 650 flow. Second operand has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 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) [2021-12-28 02:49:45,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:45,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:49:45,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:46,160 INFO L129 PetriNetUnfolder]: 550/1364 cut-off events. [2021-12-28 02:49:46,160 INFO L130 PetriNetUnfolder]: For 19946/20223 co-relation queries the response was YES. [2021-12-28 02:49:46,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8003 conditions, 1364 events. 550/1364 cut-off events. For 19946/20223 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8635 event pairs, 98 based on Foata normal form. 47/1344 useless extension candidates. Maximal degree in co-relation 7909. Up to 506 conditions per place. [2021-12-28 02:49:46,180 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 41 selfloop transitions, 17 changer transitions 25/176 dead transitions. [2021-12-28 02:49:46,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 176 transitions, 1488 flow [2021-12-28 02:49:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 02:49:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-28 02:49:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1365 transitions. [2021-12-28 02:49:46,184 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8488805970149254 [2021-12-28 02:49:46,184 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1365 transitions. [2021-12-28 02:49:46,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1365 transitions. [2021-12-28 02:49:46,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:46,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1365 transitions. [2021-12-28 02:49:46,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.75) internal successors, (1365), 12 states have internal predecessors, (1365), 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) [2021-12-28 02:49:46,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 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) [2021-12-28 02:49:46,188 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 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) [2021-12-28 02:49:46,188 INFO L186 Difference]: Start difference. First operand has 166 places, 136 transitions, 650 flow. Second operand 12 states and 1365 transitions. [2021-12-28 02:49:46,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 176 transitions, 1488 flow [2021-12-28 02:49:46,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 176 transitions, 1263 flow, removed 100 selfloop flow, removed 10 redundant places. [2021-12-28 02:49:46,200 INFO L242 Difference]: Finished difference. Result has 171 places, 139 transitions, 676 flow [2021-12-28 02:49:46,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=676, PETRI_PLACES=171, PETRI_TRANSITIONS=139} [2021-12-28 02:49:46,201 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 30 predicate places. [2021-12-28 02:49:46,201 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 139 transitions, 676 flow [2021-12-28 02:49:46,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 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) [2021-12-28 02:49:46,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:46,201 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:46,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 02:49:46,201 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash -575840605, now seen corresponding path program 3 times [2021-12-28 02:49:46,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:46,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671515421] [2021-12-28 02:49:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:46,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:46,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:46,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671515421] [2021-12-28 02:49:46,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671515421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:46,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:46,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 02:49:46,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981605065] [2021-12-28 02:49:46,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:46,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 02:49:46,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 02:49:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-28 02:49:46,361 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:49:46,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 139 transitions, 676 flow. Second operand has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:46,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:46,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:49:46,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:46,872 INFO L129 PetriNetUnfolder]: 556/1376 cut-off events. [2021-12-28 02:49:46,872 INFO L130 PetriNetUnfolder]: For 24023/24263 co-relation queries the response was YES. [2021-12-28 02:49:46,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8681 conditions, 1376 events. 556/1376 cut-off events. For 24023/24263 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8707 event pairs, 98 based on Foata normal form. 47/1356 useless extension candidates. Maximal degree in co-relation 8586. Up to 511 conditions per place. [2021-12-28 02:49:46,890 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 39 selfloop transitions, 22 changer transitions 25/179 dead transitions. [2021-12-28 02:49:46,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 1618 flow [2021-12-28 02:49:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1473 transitions. [2021-12-28 02:49:46,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8455797933409873 [2021-12-28 02:49:46,893 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1473 transitions. [2021-12-28 02:49:46,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1473 transitions. [2021-12-28 02:49:46,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:46,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1473 transitions. [2021-12-28 02:49:46,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.3076923076923) internal successors, (1473), 13 states have internal predecessors, (1473), 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) [2021-12-28 02:49:46,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:46,898 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:46,898 INFO L186 Difference]: Start difference. First operand has 171 places, 139 transitions, 676 flow. Second operand 13 states and 1473 transitions. [2021-12-28 02:49:46,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 1618 flow [2021-12-28 02:49:46,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 179 transitions, 1529 flow, removed 31 selfloop flow, removed 7 redundant places. [2021-12-28 02:49:46,912 INFO L242 Difference]: Finished difference. Result has 177 places, 142 transitions, 772 flow [2021-12-28 02:49:46,912 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=772, PETRI_PLACES=177, PETRI_TRANSITIONS=142} [2021-12-28 02:49:46,913 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 36 predicate places. [2021-12-28 02:49:46,913 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 142 transitions, 772 flow [2021-12-28 02:49:46,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:46,913 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:46,914 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:46,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 02:49:46,914 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash -165882011, now seen corresponding path program 4 times [2021-12-28 02:49:46,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:46,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726149923] [2021-12-28 02:49:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:46,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:47,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:47,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726149923] [2021-12-28 02:49:47,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726149923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:47,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:47,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 02:49:47,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121425501] [2021-12-28 02:49:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:47,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 02:49:47,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:47,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 02:49:47,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-28 02:49:47,056 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:49:47,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 142 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 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) [2021-12-28 02:49:47,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:47,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:49:47,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:47,531 INFO L129 PetriNetUnfolder]: 612/1335 cut-off events. [2021-12-28 02:49:47,532 INFO L130 PetriNetUnfolder]: For 44164/44941 co-relation queries the response was YES. [2021-12-28 02:49:47,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11415 conditions, 1335 events. 612/1335 cut-off events. For 44164/44941 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8163 event pairs, 53 based on Foata normal form. 37/1313 useless extension candidates. Maximal degree in co-relation 11315. Up to 515 conditions per place. [2021-12-28 02:49:47,555 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 54 selfloop transitions, 13 changer transitions 25/185 dead transitions. [2021-12-28 02:49:47,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 185 transitions, 1978 flow [2021-12-28 02:49:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 02:49:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-28 02:49:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1363 transitions. [2021-12-28 02:49:47,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847636815920398 [2021-12-28 02:49:47,557 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1363 transitions. [2021-12-28 02:49:47,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1363 transitions. [2021-12-28 02:49:47,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:47,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1363 transitions. [2021-12-28 02:49:47,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.58333333333333) internal successors, (1363), 12 states have internal predecessors, (1363), 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) [2021-12-28 02:49:47,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 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) [2021-12-28 02:49:47,561 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 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) [2021-12-28 02:49:47,561 INFO L186 Difference]: Start difference. First operand has 177 places, 142 transitions, 772 flow. Second operand 12 states and 1363 transitions. [2021-12-28 02:49:47,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 185 transitions, 1978 flow [2021-12-28 02:49:47,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 185 transitions, 1485 flow, removed 230 selfloop flow, removed 14 redundant places. [2021-12-28 02:49:47,583 INFO L242 Difference]: Finished difference. Result has 175 places, 145 transitions, 759 flow [2021-12-28 02:49:47,583 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=759, PETRI_PLACES=175, PETRI_TRANSITIONS=145} [2021-12-28 02:49:47,583 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 34 predicate places. [2021-12-28 02:49:47,583 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 145 transitions, 759 flow [2021-12-28 02:49:47,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 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) [2021-12-28 02:49:47,584 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:47,584 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:47,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 02:49:47,584 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1321921059, now seen corresponding path program 1 times [2021-12-28 02:49:47,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:47,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089786174] [2021-12-28 02:49:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:47,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:47,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:47,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089786174] [2021-12-28 02:49:47,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089786174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:47,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:47,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 02:49:47,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940774072] [2021-12-28 02:49:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:47,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 02:49:47,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:47,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 02:49:47,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-28 02:49:47,794 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:49:47,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 145 transitions, 759 flow. Second operand has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 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) [2021-12-28 02:49:47,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:47,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:49:47,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:48,254 INFO L129 PetriNetUnfolder]: 528/1270 cut-off events. [2021-12-28 02:49:48,255 INFO L130 PetriNetUnfolder]: For 26503/27140 co-relation queries the response was YES. [2021-12-28 02:49:48,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8909 conditions, 1270 events. 528/1270 cut-off events. For 26503/27140 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7918 event pairs, 41 based on Foata normal form. 54/1259 useless extension candidates. Maximal degree in co-relation 8812. Up to 510 conditions per place. [2021-12-28 02:49:48,273 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 47 selfloop transitions, 30 changer transitions 19/189 dead transitions. [2021-12-28 02:49:48,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 189 transitions, 1792 flow [2021-12-28 02:49:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 02:49:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-28 02:49:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1584 transitions. [2021-12-28 02:49:48,275 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8443496801705757 [2021-12-28 02:49:48,275 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1584 transitions. [2021-12-28 02:49:48,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1584 transitions. [2021-12-28 02:49:48,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:48,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1584 transitions. [2021-12-28 02:49:48,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.14285714285714) internal successors, (1584), 14 states have internal predecessors, (1584), 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) [2021-12-28 02:49:48,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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) [2021-12-28 02:49:48,279 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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) [2021-12-28 02:49:48,280 INFO L186 Difference]: Start difference. First operand has 175 places, 145 transitions, 759 flow. Second operand 14 states and 1584 transitions. [2021-12-28 02:49:48,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 189 transitions, 1792 flow [2021-12-28 02:49:48,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 189 transitions, 1585 flow, removed 99 selfloop flow, removed 9 redundant places. [2021-12-28 02:49:48,296 INFO L242 Difference]: Finished difference. Result has 181 places, 151 transitions, 944 flow [2021-12-28 02:49:48,296 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=944, PETRI_PLACES=181, PETRI_TRANSITIONS=151} [2021-12-28 02:49:48,296 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 40 predicate places. [2021-12-28 02:49:48,296 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 151 transitions, 944 flow [2021-12-28 02:49:48,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 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) [2021-12-28 02:49:48,297 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:48,297 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:48,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 02:49:48,297 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash 751659821, now seen corresponding path program 2 times [2021-12-28 02:49:48,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577794410] [2021-12-28 02:49:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:48,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:48,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:48,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577794410] [2021-12-28 02:49:48,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577794410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:48,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:48,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 02:49:48,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094201851] [2021-12-28 02:49:48,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:48,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 02:49:48,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 02:49:48,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-28 02:49:48,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2021-12-28 02:49:48,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 151 transitions, 944 flow. Second operand has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 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) [2021-12-28 02:49:48,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:48,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2021-12-28 02:49:48,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:48,836 INFO L129 PetriNetUnfolder]: 544/1316 cut-off events. [2021-12-28 02:49:48,836 INFO L130 PetriNetUnfolder]: For 27405/28947 co-relation queries the response was YES. [2021-12-28 02:49:48,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9455 conditions, 1316 events. 544/1316 cut-off events. For 27405/28947 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8648 event pairs, 59 based on Foata normal form. 38/1289 useless extension candidates. Maximal degree in co-relation 9353. Up to 617 conditions per place. [2021-12-28 02:49:48,852 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 57 selfloop transitions, 18 changer transitions 19/185 dead transitions. [2021-12-28 02:49:48,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 185 transitions, 1866 flow [2021-12-28 02:49:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1443 transitions. [2021-12-28 02:49:48,854 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2021-12-28 02:49:48,855 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1443 transitions. [2021-12-28 02:49:48,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1443 transitions. [2021-12-28 02:49:48,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:48,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1443 transitions. [2021-12-28 02:49:48,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.0) internal successors, (1443), 13 states have internal predecessors, (1443), 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) [2021-12-28 02:49:48,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:48,858 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:48,858 INFO L186 Difference]: Start difference. First operand has 181 places, 151 transitions, 944 flow. Second operand 13 states and 1443 transitions. [2021-12-28 02:49:48,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 185 transitions, 1866 flow [2021-12-28 02:49:48,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 185 transitions, 1651 flow, removed 99 selfloop flow, removed 10 redundant places. [2021-12-28 02:49:48,879 INFO L242 Difference]: Finished difference. Result has 184 places, 153 transitions, 978 flow [2021-12-28 02:49:48,879 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=978, PETRI_PLACES=184, PETRI_TRANSITIONS=153} [2021-12-28 02:49:48,879 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 43 predicate places. [2021-12-28 02:49:48,880 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 153 transitions, 978 flow [2021-12-28 02:49:48,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 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) [2021-12-28 02:49:48,880 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:48,880 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:48,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 02:49:48,880 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 662389671, now seen corresponding path program 3 times [2021-12-28 02:49:48,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:48,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270340737] [2021-12-28 02:49:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:48,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:49,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:49,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270340737] [2021-12-28 02:49:49,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270340737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:49,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:49,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 02:49:49,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784539706] [2021-12-28 02:49:49,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:49,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 02:49:49,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 02:49:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-28 02:49:49,084 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2021-12-28 02:49:49,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 153 transitions, 978 flow. Second operand has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 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) [2021-12-28 02:49:49,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:49,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2021-12-28 02:49:49,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:49,677 INFO L129 PetriNetUnfolder]: 546/1406 cut-off events. [2021-12-28 02:49:49,677 INFO L130 PetriNetUnfolder]: For 29779/30276 co-relation queries the response was YES. [2021-12-28 02:49:49,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9595 conditions, 1406 events. 546/1406 cut-off events. For 29779/30276 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9258 event pairs, 90 based on Foata normal form. 79/1413 useless extension candidates. Maximal degree in co-relation 9491. Up to 614 conditions per place. [2021-12-28 02:49:49,696 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 53 selfloop transitions, 24 changer transitions 19/187 dead transitions. [2021-12-28 02:49:49,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 1938 flow [2021-12-28 02:49:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 02:49:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-28 02:49:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1549 transitions. [2021-12-28 02:49:49,709 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8256929637526652 [2021-12-28 02:49:49,709 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1549 transitions. [2021-12-28 02:49:49,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1549 transitions. [2021-12-28 02:49:49,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:49,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1549 transitions. [2021-12-28 02:49:49,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.64285714285714) internal successors, (1549), 14 states have internal predecessors, (1549), 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) [2021-12-28 02:49:49,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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) [2021-12-28 02:49:49,713 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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) [2021-12-28 02:49:49,713 INFO L186 Difference]: Start difference. First operand has 184 places, 153 transitions, 978 flow. Second operand 14 states and 1549 transitions. [2021-12-28 02:49:49,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 1938 flow [2021-12-28 02:49:49,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 187 transitions, 1717 flow, removed 96 selfloop flow, removed 11 redundant places. [2021-12-28 02:49:49,734 INFO L242 Difference]: Finished difference. Result has 187 places, 155 transitions, 1027 flow [2021-12-28 02:49:49,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1027, PETRI_PLACES=187, PETRI_TRANSITIONS=155} [2021-12-28 02:49:49,735 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 46 predicate places. [2021-12-28 02:49:49,735 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 155 transitions, 1027 flow [2021-12-28 02:49:49,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 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) [2021-12-28 02:49:49,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:49,736 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:49,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 02:49:49,736 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash 347658729, now seen corresponding path program 4 times [2021-12-28 02:49:49,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:49,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405828436] [2021-12-28 02:49:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:49,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:49,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:49,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405828436] [2021-12-28 02:49:49,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405828436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:49,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:49,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 02:49:49,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233698992] [2021-12-28 02:49:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:49,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 02:49:49,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:49,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 02:49:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-28 02:49:49,872 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2021-12-28 02:49:49,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 155 transitions, 1027 flow. Second operand has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 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) [2021-12-28 02:49:49,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:49,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2021-12-28 02:49:49,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:50,360 INFO L129 PetriNetUnfolder]: 564/1468 cut-off events. [2021-12-28 02:49:50,360 INFO L130 PetriNetUnfolder]: For 32992/34159 co-relation queries the response was YES. [2021-12-28 02:49:50,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10332 conditions, 1468 events. 564/1468 cut-off events. For 32992/34159 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10248 event pairs, 53 based on Foata normal form. 31/1434 useless extension candidates. Maximal degree in co-relation 10226. Up to 498 conditions per place. [2021-12-28 02:49:50,386 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 64 selfloop transitions, 17 changer transitions 19/191 dead transitions. [2021-12-28 02:49:50,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 2065 flow [2021-12-28 02:49:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1441 transitions. [2021-12-28 02:49:50,389 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8272101033295063 [2021-12-28 02:49:50,389 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1441 transitions. [2021-12-28 02:49:50,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1441 transitions. [2021-12-28 02:49:50,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:50,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1441 transitions. [2021-12-28 02:49:50,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 110.84615384615384) internal successors, (1441), 13 states have internal predecessors, (1441), 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) [2021-12-28 02:49:50,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:50,393 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:50,394 INFO L186 Difference]: Start difference. First operand has 187 places, 155 transitions, 1027 flow. Second operand 13 states and 1441 transitions. [2021-12-28 02:49:50,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 2065 flow [2021-12-28 02:49:50,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 191 transitions, 1799 flow, removed 115 selfloop flow, removed 12 redundant places. [2021-12-28 02:49:50,413 INFO L242 Difference]: Finished difference. Result has 188 places, 157 transitions, 1060 flow [2021-12-28 02:49:50,413 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1060, PETRI_PLACES=188, PETRI_TRANSITIONS=157} [2021-12-28 02:49:50,414 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 47 predicate places. [2021-12-28 02:49:50,414 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 157 transitions, 1060 flow [2021-12-28 02:49:50,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 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) [2021-12-28 02:49:50,414 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:50,414 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:50,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 02:49:50,415 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1063553185, now seen corresponding path program 1 times [2021-12-28 02:49:50,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:50,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198908507] [2021-12-28 02:49:50,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:50,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:50,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:50,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198908507] [2021-12-28 02:49:50,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198908507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:50,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:50,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:50,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468500741] [2021-12-28 02:49:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:50,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:50,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:50,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:50,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:50,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:49:50,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 157 transitions, 1060 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2021-12-28 02:49:50,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:50,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:49:50,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:52,480 INFO L129 PetriNetUnfolder]: 7299/12583 cut-off events. [2021-12-28 02:49:52,481 INFO L130 PetriNetUnfolder]: For 263060/265667 co-relation queries the response was YES. [2021-12-28 02:49:52,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68985 conditions, 12583 events. 7299/12583 cut-off events. For 263060/265667 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 98969 event pairs, 352 based on Foata normal form. 1034/13151 useless extension candidates. Maximal degree in co-relation 68885. Up to 4591 conditions per place. [2021-12-28 02:49:52,620 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 240 selfloop transitions, 18 changer transitions 12/365 dead transitions. [2021-12-28 02:49:52,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 365 transitions, 4689 flow [2021-12-28 02:49:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:49:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:49:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1172 transitions. [2021-12-28 02:49:52,622 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8746268656716418 [2021-12-28 02:49:52,622 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1172 transitions. [2021-12-28 02:49:52,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1172 transitions. [2021-12-28 02:49:52,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:52,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1172 transitions. [2021-12-28 02:49:52,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.2) internal successors, (1172), 10 states have internal predecessors, (1172), 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) [2021-12-28 02:49:52,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:52,626 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:52,626 INFO L186 Difference]: Start difference. First operand has 188 places, 157 transitions, 1060 flow. Second operand 10 states and 1172 transitions. [2021-12-28 02:49:52,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 365 transitions, 4689 flow [2021-12-28 02:49:52,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 365 transitions, 4319 flow, removed 134 selfloop flow, removed 11 redundant places. [2021-12-28 02:49:52,717 INFO L242 Difference]: Finished difference. Result has 186 places, 173 transitions, 1123 flow [2021-12-28 02:49:52,718 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1123, PETRI_PLACES=186, PETRI_TRANSITIONS=173} [2021-12-28 02:49:52,718 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 45 predicate places. [2021-12-28 02:49:52,718 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 173 transitions, 1123 flow [2021-12-28 02:49:52,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2021-12-28 02:49:52,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:52,719 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:52,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 02:49:52,719 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash -70393184, now seen corresponding path program 1 times [2021-12-28 02:49:52,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:52,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542399138] [2021-12-28 02:49:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:52,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:52,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:52,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542399138] [2021-12-28 02:49:52,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542399138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:52,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:52,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:49:52,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822956013] [2021-12-28 02:49:52,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:52,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:49:52,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:49:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:49:52,786 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:49:52,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 173 transitions, 1123 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 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) [2021-12-28 02:49:52,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:52,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:49:52,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:54,629 INFO L129 PetriNetUnfolder]: 6626/11960 cut-off events. [2021-12-28 02:49:54,630 INFO L130 PetriNetUnfolder]: For 195485/198283 co-relation queries the response was YES. [2021-12-28 02:49:54,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68137 conditions, 11960 events. 6626/11960 cut-off events. For 195485/198283 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 100002 event pairs, 148 based on Foata normal form. 1308/13044 useless extension candidates. Maximal degree in co-relation 68038. Up to 3132 conditions per place. [2021-12-28 02:49:54,740 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 269 selfloop transitions, 36 changer transitions 40/440 dead transitions. [2021-12-28 02:49:54,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 440 transitions, 5748 flow [2021-12-28 02:49:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2021-12-28 02:49:54,742 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8754305396096441 [2021-12-28 02:49:54,742 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1525 transitions. [2021-12-28 02:49:54,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1525 transitions. [2021-12-28 02:49:54,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:54,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1525 transitions. [2021-12-28 02:49:54,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.3076923076923) internal successors, (1525), 13 states have internal predecessors, (1525), 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) [2021-12-28 02:49:54,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:54,747 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:54,747 INFO L186 Difference]: Start difference. First operand has 186 places, 173 transitions, 1123 flow. Second operand 13 states and 1525 transitions. [2021-12-28 02:49:54,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 440 transitions, 5748 flow [2021-12-28 02:49:54,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 440 transitions, 5746 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-28 02:49:54,880 INFO L242 Difference]: Finished difference. Result has 203 places, 189 transitions, 1354 flow [2021-12-28 02:49:54,880 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1354, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2021-12-28 02:49:54,881 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 62 predicate places. [2021-12-28 02:49:54,881 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 1354 flow [2021-12-28 02:49:54,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 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) [2021-12-28 02:49:54,881 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:54,881 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:54,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 02:49:54,882 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 630994345, now seen corresponding path program 1 times [2021-12-28 02:49:54,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:54,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728812565] [2021-12-28 02:49:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:54,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:54,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:54,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728812565] [2021-12-28 02:49:54,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728812565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:54,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:54,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:54,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006721125] [2021-12-28 02:49:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:54,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:54,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:54,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:54,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:54,947 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2021-12-28 02:49:54,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 1354 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2021-12-28 02:49:54,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:54,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2021-12-28 02:49:54,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:56,168 INFO L129 PetriNetUnfolder]: 2490/8635 cut-off events. [2021-12-28 02:49:56,168 INFO L130 PetriNetUnfolder]: For 62976/70969 co-relation queries the response was YES. [2021-12-28 02:49:56,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37722 conditions, 8635 events. 2490/8635 cut-off events. For 62976/70969 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 106079 event pairs, 326 based on Foata normal form. 199/8234 useless extension candidates. Maximal degree in co-relation 37615. Up to 2397 conditions per place. [2021-12-28 02:49:56,461 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 130 selfloop transitions, 11 changer transitions 22/297 dead transitions. [2021-12-28 02:49:56,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 297 transitions, 3565 flow [2021-12-28 02:49:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1063 transitions. [2021-12-28 02:49:56,464 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814262023217247 [2021-12-28 02:49:56,464 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1063 transitions. [2021-12-28 02:49:56,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1063 transitions. [2021-12-28 02:49:56,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:56,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1063 transitions. [2021-12-28 02:49:56,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:56,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:56,467 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:56,467 INFO L186 Difference]: Start difference. First operand has 203 places, 189 transitions, 1354 flow. Second operand 9 states and 1063 transitions. [2021-12-28 02:49:56,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 297 transitions, 3565 flow [2021-12-28 02:49:56,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 297 transitions, 3464 flow, removed 42 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:56,912 INFO L242 Difference]: Finished difference. Result has 214 places, 197 transitions, 1406 flow [2021-12-28 02:49:56,913 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1406, PETRI_PLACES=214, PETRI_TRANSITIONS=197} [2021-12-28 02:49:56,913 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 73 predicate places. [2021-12-28 02:49:56,913 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 197 transitions, 1406 flow [2021-12-28 02:49:56,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2021-12-28 02:49:56,914 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:56,914 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:56,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 02:49:56,914 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:56,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 145875966, now seen corresponding path program 1 times [2021-12-28 02:49:56,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:56,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864494666] [2021-12-28 02:49:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:56,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:56,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:56,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864494666] [2021-12-28 02:49:56,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864494666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:56,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:56,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:49:56,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354791841] [2021-12-28 02:49:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:56,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:49:56,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:56,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:49:56,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:49:56,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:49:56,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 197 transitions, 1406 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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) [2021-12-28 02:49:56,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:56,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:49:56,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:59,633 INFO L129 PetriNetUnfolder]: 9046/16577 cut-off events. [2021-12-28 02:49:59,634 INFO L130 PetriNetUnfolder]: For 288284/292387 co-relation queries the response was YES. [2021-12-28 02:49:59,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97391 conditions, 16577 events. 9046/16577 cut-off events. For 288284/292387 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 152333 event pairs, 93 based on Foata normal form. 2071/18336 useless extension candidates. Maximal degree in co-relation 97278. Up to 3080 conditions per place. [2021-12-28 02:49:59,764 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 124 selfloop transitions, 25 changer transitions 227/470 dead transitions. [2021-12-28 02:49:59,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 470 transitions, 6436 flow [2021-12-28 02:49:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:49:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-28 02:49:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1878 transitions. [2021-12-28 02:49:59,767 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759328358208955 [2021-12-28 02:49:59,767 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1878 transitions. [2021-12-28 02:49:59,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1878 transitions. [2021-12-28 02:49:59,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:59,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1878 transitions. [2021-12-28 02:49:59,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.375) internal successors, (1878), 16 states have internal predecessors, (1878), 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) [2021-12-28 02:49:59,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:59,772 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:59,772 INFO L186 Difference]: Start difference. First operand has 214 places, 197 transitions, 1406 flow. Second operand 16 states and 1878 transitions. [2021-12-28 02:49:59,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 470 transitions, 6436 flow [2021-12-28 02:50:00,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 470 transitions, 5784 flow, removed 146 selfloop flow, removed 11 redundant places. [2021-12-28 02:50:00,488 INFO L242 Difference]: Finished difference. Result has 225 places, 163 transitions, 1100 flow [2021-12-28 02:50:00,489 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1100, PETRI_PLACES=225, PETRI_TRANSITIONS=163} [2021-12-28 02:50:00,489 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 84 predicate places. [2021-12-28 02:50:00,489 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 163 transitions, 1100 flow [2021-12-28 02:50:00,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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) [2021-12-28 02:50:00,489 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:00,490 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:00,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 02:50:00,497 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:50:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -592772304, now seen corresponding path program 1 times [2021-12-28 02:50:00,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:00,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434178834] [2021-12-28 02:50:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:00,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:00,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:00,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434178834] [2021-12-28 02:50:00,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434178834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:00,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:00,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:50:00,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369157356] [2021-12-28 02:50:00,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:00,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:50:00,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:50:00,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:50:00,670 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-28 02:50:00,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 163 transitions, 1100 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 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) [2021-12-28 02:50:00,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:00,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-28 02:50:00,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:02,309 INFO L129 PetriNetUnfolder]: 4361/9096 cut-off events. [2021-12-28 02:50:02,309 INFO L130 PetriNetUnfolder]: For 139358/140770 co-relation queries the response was YES. [2021-12-28 02:50:02,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53532 conditions, 9096 events. 4361/9096 cut-off events. For 139358/140770 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 89161 event pairs, 76 based on Foata normal form. 705/9613 useless extension candidates. Maximal degree in co-relation 53471. Up to 1876 conditions per place. [2021-12-28 02:50:02,521 INFO L132 encePairwiseOnDemand]: 124/134 looper letters, 105 selfloop transitions, 29 changer transitions 124/352 dead transitions. [2021-12-28 02:50:02,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 352 transitions, 4268 flow [2021-12-28 02:50:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:50:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-28 02:50:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1835 transitions. [2021-12-28 02:50:02,537 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8558768656716418 [2021-12-28 02:50:02,537 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1835 transitions. [2021-12-28 02:50:02,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1835 transitions. [2021-12-28 02:50:02,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:02,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1835 transitions. [2021-12-28 02:50:02,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.6875) internal successors, (1835), 16 states have internal predecessors, (1835), 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) [2021-12-28 02:50:02,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:02,542 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:02,542 INFO L186 Difference]: Start difference. First operand has 225 places, 163 transitions, 1100 flow. Second operand 16 states and 1835 transitions. [2021-12-28 02:50:02,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 352 transitions, 4268 flow [2021-12-28 02:50:02,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 352 transitions, 3503 flow, removed 338 selfloop flow, removed 26 redundant places. [2021-12-28 02:50:02,961 INFO L242 Difference]: Finished difference. Result has 205 places, 162 transitions, 925 flow [2021-12-28 02:50:02,962 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=925, PETRI_PLACES=205, PETRI_TRANSITIONS=162} [2021-12-28 02:50:02,962 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 64 predicate places. [2021-12-28 02:50:02,962 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 162 transitions, 925 flow [2021-12-28 02:50:02,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 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) [2021-12-28 02:50:02,963 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:02,963 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:02,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 02:50:02,963 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:50:02,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash 727786334, now seen corresponding path program 1 times [2021-12-28 02:50:02,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:02,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349328739] [2021-12-28 02:50:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:02,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:03,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349328739] [2021-12-28 02:50:03,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349328739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:03,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:03,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:50:03,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912046078] [2021-12-28 02:50:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:03,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:50:03,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:03,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:50:03,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:50:03,055 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2021-12-28 02:50:03,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 162 transitions, 925 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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) [2021-12-28 02:50:03,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:03,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2021-12-28 02:50:03,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:03,784 INFO L129 PetriNetUnfolder]: 1259/5316 cut-off events. [2021-12-28 02:50:03,784 INFO L130 PetriNetUnfolder]: For 19085/20943 co-relation queries the response was YES. [2021-12-28 02:50:03,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18623 conditions, 5316 events. 1259/5316 cut-off events. For 19085/20943 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 67162 event pairs, 37 based on Foata normal form. 37/4866 useless extension candidates. Maximal degree in co-relation 18519. Up to 963 conditions per place. [2021-12-28 02:50:03,825 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 68 selfloop transitions, 2 changer transitions 5/198 dead transitions. [2021-12-28 02:50:03,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 198 transitions, 1407 flow [2021-12-28 02:50:03,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 02:50:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-28 02:50:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2021-12-28 02:50:03,827 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8550106609808102 [2021-12-28 02:50:03,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 802 transitions. [2021-12-28 02:50:03,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 802 transitions. [2021-12-28 02:50:03,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:03,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 802 transitions. [2021-12-28 02:50:03,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 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) [2021-12-28 02:50:03,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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) [2021-12-28 02:50:03,830 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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) [2021-12-28 02:50:03,830 INFO L186 Difference]: Start difference. First operand has 205 places, 162 transitions, 925 flow. Second operand 7 states and 802 transitions. [2021-12-28 02:50:03,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 198 transitions, 1407 flow [2021-12-28 02:50:04,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 198 transitions, 1136 flow, removed 97 selfloop flow, removed 25 redundant places. [2021-12-28 02:50:04,009 INFO L242 Difference]: Finished difference. Result has 187 places, 163 transitions, 741 flow [2021-12-28 02:50:04,010 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=741, PETRI_PLACES=187, PETRI_TRANSITIONS=163} [2021-12-28 02:50:04,010 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 46 predicate places. [2021-12-28 02:50:04,010 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 163 transitions, 741 flow [2021-12-28 02:50:04,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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) [2021-12-28 02:50:04,010 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:04,011 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:04,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 02:50:04,011 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:50:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1203390452, now seen corresponding path program 2 times [2021-12-28 02:50:04,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499135810] [2021-12-28 02:50:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:04,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:04,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:04,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499135810] [2021-12-28 02:50:04,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499135810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:04,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:04,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:50:04,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126498289] [2021-12-28 02:50:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:04,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:50:04,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:04,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:50:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:50:04,086 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2021-12-28 02:50:04,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 163 transitions, 741 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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) [2021-12-28 02:50:04,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:04,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2021-12-28 02:50:04,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:05,338 INFO L129 PetriNetUnfolder]: 2745/12303 cut-off events. [2021-12-28 02:50:05,338 INFO L130 PetriNetUnfolder]: For 16835/17949 co-relation queries the response was YES. [2021-12-28 02:50:05,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32846 conditions, 12303 events. 2745/12303 cut-off events. For 16835/17949 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 183871 event pairs, 30 based on Foata normal form. 64/11461 useless extension candidates. Maximal degree in co-relation 32812. Up to 1925 conditions per place. [2021-12-28 02:50:05,422 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 27 selfloop transitions, 1 changer transitions 70/220 dead transitions. [2021-12-28 02:50:05,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 220 transitions, 1379 flow [2021-12-28 02:50:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 02:50:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-28 02:50:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2021-12-28 02:50:05,424 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8603411513859275 [2021-12-28 02:50:05,424 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2021-12-28 02:50:05,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2021-12-28 02:50:05,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:05,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2021-12-28 02:50:05,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 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) [2021-12-28 02:50:05,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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) [2021-12-28 02:50:05,427 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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) [2021-12-28 02:50:05,427 INFO L186 Difference]: Start difference. First operand has 187 places, 163 transitions, 741 flow. Second operand 7 states and 807 transitions. [2021-12-28 02:50:05,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 220 transitions, 1379 flow [2021-12-28 02:50:06,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 220 transitions, 1368 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-28 02:50:06,208 INFO L242 Difference]: Finished difference. Result has 191 places, 148 transitions, 626 flow [2021-12-28 02:50:06,208 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=626, PETRI_PLACES=191, PETRI_TRANSITIONS=148} [2021-12-28 02:50:06,209 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 50 predicate places. [2021-12-28 02:50:06,209 INFO L470 AbstractCegarLoop]: Abstraction has has 191 places, 148 transitions, 626 flow [2021-12-28 02:50:06,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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) [2021-12-28 02:50:06,209 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:06,209 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:06,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 02:50:06,210 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:50:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash -528436458, now seen corresponding path program 3 times [2021-12-28 02:50:06,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:06,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287333402] [2021-12-28 02:50:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:06,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:50:06,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 02:50:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:50:06,321 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 02:50:06,322 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 02:50:06,323 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-28 02:50:06,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-28 02:50:06,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-28 02:50:06,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-28 02:50:06,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-28 02:50:06,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-28 02:50:06,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-28 02:50:06,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 02:50:06,328 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:06,332 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-28 02:50:06,332 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 02:50:06,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:50:06 BasicIcfg [2021-12-28 02:50:06,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 02:50:06,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 02:50:06,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 02:50:06,456 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 02:50:06,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:49:40" (3/4) ... [2021-12-28 02:50:06,457 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 02:50:06,539 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 02:50:06,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 02:50:06,540 INFO L158 Benchmark]: Toolchain (without parser) took 27841.72ms. Allocated memory was 65.0MB in the beginning and 7.7GB in the end (delta: 7.7GB). Free memory was 43.6MB in the beginning and 6.6GB in the end (delta: -6.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-12-28 02:50:06,540 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 65.0MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:50:06,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.72ms. Allocated memory is still 65.0MB. Free memory was 43.4MB in the beginning and 34.5MB in the end (delta: 8.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2021-12-28 02:50:06,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.93ms. Allocated memory was 65.0MB in the beginning and 104.9MB in the end (delta: 39.8MB). Free memory was 34.4MB in the beginning and 86.3MB in the end (delta: -51.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2021-12-28 02:50:06,541 INFO L158 Benchmark]: Boogie Preprocessor took 50.26ms. Allocated memory is still 104.9MB. Free memory was 86.3MB in the beginning and 84.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 02:50:06,541 INFO L158 Benchmark]: RCFGBuilder took 837.96ms. Allocated memory is still 104.9MB. Free memory was 84.2MB in the beginning and 68.2MB in the end (delta: 16.0MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2021-12-28 02:50:06,542 INFO L158 Benchmark]: TraceAbstraction took 26275.58ms. Allocated memory was 104.9MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 68.2MB in the beginning and 6.6GB in the end (delta: -6.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-12-28 02:50:06,542 INFO L158 Benchmark]: Witness Printer took 84.06ms. Allocated memory is still 7.7GB. Free memory was 6.6GB in the beginning and 6.6GB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-28 02:50:06,546 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.14ms. Allocated memory is still 65.0MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.72ms. Allocated memory is still 65.0MB. Free memory was 43.4MB in the beginning and 34.5MB in the end (delta: 8.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.93ms. Allocated memory was 65.0MB in the beginning and 104.9MB in the end (delta: 39.8MB). Free memory was 34.4MB in the beginning and 86.3MB in the end (delta: -51.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.26ms. Allocated memory is still 104.9MB. Free memory was 86.3MB in the beginning and 84.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 837.96ms. Allocated memory is still 104.9MB. Free memory was 84.2MB in the beginning and 68.2MB in the end (delta: 16.0MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26275.58ms. Allocated memory was 104.9MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 68.2MB in the beginning and 6.6GB in the end (delta: -6.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 84.06ms. Allocated memory is still 7.7GB. Free memory was 6.6GB in the beginning and 6.6GB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L841] 0 pthread_t t1433; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L843] 0 pthread_t t1434; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L845] 0 pthread_t t1435; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L847] 0 pthread_t t1436; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 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) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 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 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 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) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 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 [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 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 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 848]: 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: 844]: 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: 842]: 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1356 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1356 mSDsluCounter, 1212 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2026 mSDsCounter, 523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3622 IncrementalHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 523 mSolverCounterUnsat, 225 mSDtfsCounter, 3622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1406occurred in iteration=18, InterpolantAutomatonStates: 264, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2073 NumberOfCodeBlocks, 2073 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1948 ConstructedInterpolants, 0 QuantifiedInterpolants, 11132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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! [2021-12-28 02:50:06,602 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