./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:38:16,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:38:16,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:38:16,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:38:16,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:38:16,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:38:16,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:38:16,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:38:16,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:38:16,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:38:16,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:38:16,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:38:16,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:38:16,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:38:16,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:38:16,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:38:16,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:38:16,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:38:16,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:38:16,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:38:16,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:38:16,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:38:16,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:38:16,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:38:16,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:38:16,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:38:16,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:38:16,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:38:16,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:38:16,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:38:16,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:38:16,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:38:16,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:38:16,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:38:16,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:38:16,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:38:16,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:38:16,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:38:16,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:38:16,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:38:16,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:38:16,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:38:16,412 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:38:16,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:38:16,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:38:16,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:38:16,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:38:16,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:38:16,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:38:16,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:38:16,415 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:38:16,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:38:16,415 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:38:16,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:38:16,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:38:16,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:38:16,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:38:16,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:38:16,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:38:16,416 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:38:16,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:38:16,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:38:16,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:38:16,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:38:16,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:38:16,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:38:16,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:38:16,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:38:16,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:38:16,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:38:16,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:38:16,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:38:16,418 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:38:16,419 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:38:16,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:38:16,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:38:16,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2021-12-14 16:38:16,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:38:16,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:38:16,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:38:16,607 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:38:16,607 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:38:16,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-12-14 16:38:16,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a028b025/6dbc44da114345f39b27b17966a8b31d/FLAGfe1b1d096 [2021-12-14 16:38:17,072 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:38:17,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-12-14 16:38:17,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a028b025/6dbc44da114345f39b27b17966a8b31d/FLAGfe1b1d096 [2021-12-14 16:38:17,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a028b025/6dbc44da114345f39b27b17966a8b31d [2021-12-14 16:38:17,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:38:17,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:38:17,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:38:17,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:38:17,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:38:17,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f03829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17, skipping insertion in model container [2021-12-14 16:38:17,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:38:17,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:38:17,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-12-14 16:38:17,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:38:17,453 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:38:17,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-12-14 16:38:17,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:38:17,544 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:38:17,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17 WrapperNode [2021-12-14 16:38:17,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:38:17,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:38:17,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:38:17,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:38:17,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,611 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2021-12-14 16:38:17,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:38:17,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:38:17,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:38:17,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:38:17,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:38:17,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:38:17,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:38:17,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:38:17,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (1/1) ... [2021-12-14 16:38:17,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:38:17,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:38:17,687 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-14 16:38:17,697 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-14 16:38:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:38:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-14 16:38:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:38:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:38:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:38:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-14 16:38:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-14 16:38:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-14 16:38:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-14 16:38:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:38:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-14 16:38:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:38:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:38:17,720 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:38:17,814 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:38:17,815 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:38:18,166 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:38:18,360 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:38:18,360 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 16:38:18,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:38:18 BoogieIcfgContainer [2021-12-14 16:38:18,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:38:18,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:38:18,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:38:18,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:38:18,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:38:17" (1/3) ... [2021-12-14 16:38:18,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72509377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:38:18, skipping insertion in model container [2021-12-14 16:38:18,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:17" (2/3) ... [2021-12-14 16:38:18,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72509377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:38:18, skipping insertion in model container [2021-12-14 16:38:18,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:38:18" (3/3) ... [2021-12-14 16:38:18,369 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-12-14 16:38:18,372 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:38:18,373 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:38:18,373 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:38:18,373 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:38:18,398 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,416 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,416 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,418 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,418 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,418 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,419 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,419 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,419 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,419 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,420 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,420 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,420 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,420 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,420 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,420 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,421 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,421 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,421 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,421 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,421 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,421 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,422 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,422 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,424 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,424 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,424 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,424 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,424 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,424 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,425 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,425 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,425 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,425 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,428 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,429 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,429 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,429 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,431 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,431 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,431 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,432 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,432 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,432 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,432 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,432 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,432 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,433 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,433 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,433 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,434 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:18,436 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-14 16:38:18,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:38:18,469 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-14 16:38:18,470 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-14 16:38:18,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2021-12-14 16:38:18,503 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2021-12-14 16:38:18,503 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:38:18,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2021-12-14 16:38:18,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2021-12-14 16:38:18,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2021-12-14 16:38:18,520 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-12-14 16:38:18,521 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:38:18,521 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:18,521 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] [2021-12-14 16:38:18,522 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -761824995, now seen corresponding path program 1 times [2021-12-14 16:38:18,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:18,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936749582] [2021-12-14 16:38:18,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:18,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:18,750 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-14 16:38:18,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:18,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936749582] [2021-12-14 16:38:18,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936749582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:18,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:18,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 16:38:18,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93965445] [2021-12-14 16:38:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:18,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:38:18,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:18,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:38:18,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:38:18,783 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2021-12-14 16:38:18,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:18,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:18,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2021-12-14 16:38:18,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:18,873 INFO L129 PetriNetUnfolder]: 18/233 cut-off events. [2021-12-14 16:38:18,873 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-14 16:38:18,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 233 events. 18/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 794 event pairs, 12 based on Foata normal form. 8/227 useless extension candidates. Maximal degree in co-relation 239. Up to 31 conditions per place. [2021-12-14 16:38:18,875 INFO L132 encePairwiseOnDemand]: 88/93 looper letters, 10 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-12-14 16:38:18,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 215 flow [2021-12-14 16:38:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:38:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:38:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2021-12-14 16:38:18,889 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.931899641577061 [2021-12-14 16:38:18,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2021-12-14 16:38:18,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2021-12-14 16:38:18,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:18,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2021-12-14 16:38:18,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:18,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:18,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:18,906 INFO L186 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 260 transitions. [2021-12-14 16:38:18,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 215 flow [2021-12-14 16:38:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:38:18,912 INFO L242 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2021-12-14 16:38:18,913 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2021-12-14 16:38:18,918 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2021-12-14 16:38:18,918 INFO L470 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2021-12-14 16:38:18,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:18,919 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:18,919 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-14 16:38:18,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:38:18,919 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash -29849764, now seen corresponding path program 1 times [2021-12-14 16:38:18,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:18,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67512981] [2021-12-14 16:38:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:18,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:19,087 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-14 16:38:19,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:19,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67512981] [2021-12-14 16:38:19,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67512981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:19,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:19,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:19,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466289192] [2021-12-14 16:38:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:19,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:19,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:19,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:19,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-14 16:38:19,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:19,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-14 16:38:19,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:19,333 INFO L129 PetriNetUnfolder]: 179/654 cut-off events. [2021-12-14 16:38:19,333 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-12-14 16:38:19,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 654 events. 179/654 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3783 event pairs, 62 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 984. Up to 186 conditions per place. [2021-12-14 16:38:19,338 INFO L132 encePairwiseOnDemand]: 86/93 looper letters, 17 selfloop transitions, 3 changer transitions 43/125 dead transitions. [2021-12-14 16:38:19,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 382 flow [2021-12-14 16:38:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:38:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:38:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2021-12-14 16:38:19,341 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2021-12-14 16:38:19,341 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 713 transitions. [2021-12-14 16:38:19,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 713 transitions. [2021-12-14 16:38:19,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:19,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 713 transitions. [2021-12-14 16:38:19,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.22222222222223) internal successors, (713), 9 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,347 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,347 INFO L186 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 9 states and 713 transitions. [2021-12-14 16:38:19,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 382 flow [2021-12-14 16:38:19,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 125 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:38:19,350 INFO L242 Difference]: Finished difference. Result has 107 places, 79 transitions, 201 flow [2021-12-14 16:38:19,351 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2021-12-14 16:38:19,351 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2021-12-14 16:38:19,351 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 201 flow [2021-12-14 16:38:19,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,352 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:19,352 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] [2021-12-14 16:38:19,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:38:19,352 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1473150781, now seen corresponding path program 1 times [2021-12-14 16:38:19,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:19,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460343063] [2021-12-14 16:38:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:19,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:19,563 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-14 16:38:19,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:19,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460343063] [2021-12-14 16:38:19,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460343063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:19,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:19,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:38:19,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069611748] [2021-12-14 16:38:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:19,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:38:19,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:38:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:38:19,566 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2021-12-14 16:38:19,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 201 flow. Second operand has 10 states, 10 states have (on average 71.4) internal successors, (714), 10 states have internal predecessors, (714), 0 states have call successors, (0), 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-14 16:38:19,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:19,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2021-12-14 16:38:19,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:19,830 INFO L129 PetriNetUnfolder]: 141/410 cut-off events. [2021-12-14 16:38:19,830 INFO L130 PetriNetUnfolder]: For 307/308 co-relation queries the response was YES. [2021-12-14 16:38:19,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 410 events. 141/410 cut-off events. For 307/308 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1862 event pairs, 34 based on Foata normal form. 14/414 useless extension candidates. Maximal degree in co-relation 872. Up to 133 conditions per place. [2021-12-14 16:38:19,833 INFO L132 encePairwiseOnDemand]: 81/93 looper letters, 17 selfloop transitions, 9 changer transitions 35/122 dead transitions. [2021-12-14 16:38:19,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 441 flow [2021-12-14 16:38:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:38:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-14 16:38:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1184 transitions. [2021-12-14 16:38:19,835 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2021-12-14 16:38:19,836 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1184 transitions. [2021-12-14 16:38:19,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1184 transitions. [2021-12-14 16:38:19,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:19,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1184 transitions. [2021-12-14 16:38:19,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,842 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:19,842 INFO L186 Difference]: Start difference. First operand has 107 places, 79 transitions, 201 flow. Second operand 16 states and 1184 transitions. [2021-12-14 16:38:19,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 441 flow [2021-12-14 16:38:19,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 420 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-14 16:38:19,848 INFO L242 Difference]: Finished difference. Result has 113 places, 83 transitions, 266 flow [2021-12-14 16:38:19,848 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=266, PETRI_PLACES=113, PETRI_TRANSITIONS=83} [2021-12-14 16:38:19,849 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2021-12-14 16:38:19,850 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 83 transitions, 266 flow [2021-12-14 16:38:19,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.4) internal successors, (714), 10 states have internal predecessors, (714), 0 states have call successors, (0), 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-14 16:38:19,850 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:19,850 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] [2021-12-14 16:38:19,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:38:19,850 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -226472556, now seen corresponding path program 1 times [2021-12-14 16:38:19,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:19,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130031572] [2021-12-14 16:38:19,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:19,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:19,990 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-14 16:38:19,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:19,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130031572] [2021-12-14 16:38:19,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130031572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:19,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:19,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:38:19,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529203114] [2021-12-14 16:38:19,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:19,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:38:19,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:19,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:38:19,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:38:19,993 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-14 16:38:19,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 83 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 0 states have call successors, (0), 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-14 16:38:19,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:19,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-14 16:38:19,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:20,195 INFO L129 PetriNetUnfolder]: 111/350 cut-off events. [2021-12-14 16:38:20,195 INFO L130 PetriNetUnfolder]: For 968/976 co-relation queries the response was YES. [2021-12-14 16:38:20,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 350 events. 111/350 cut-off events. For 968/976 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1486 event pairs, 30 based on Foata normal form. 10/347 useless extension candidates. Maximal degree in co-relation 1039. Up to 119 conditions per place. [2021-12-14 16:38:20,198 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 23 selfloop transitions, 7 changer transitions 25/119 dead transitions. [2021-12-14 16:38:20,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 614 flow [2021-12-14 16:38:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:38:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:38:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1004 transitions. [2021-12-14 16:38:20,201 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8304383788254756 [2021-12-14 16:38:20,201 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1004 transitions. [2021-12-14 16:38:20,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1004 transitions. [2021-12-14 16:38:20,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:20,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1004 transitions. [2021-12-14 16:38:20,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 77.23076923076923) internal successors, (1004), 13 states have internal predecessors, (1004), 0 states have call successors, (0), 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-14 16:38:20,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 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-14 16:38:20,205 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 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-14 16:38:20,205 INFO L186 Difference]: Start difference. First operand has 113 places, 83 transitions, 266 flow. Second operand 13 states and 1004 transitions. [2021-12-14 16:38:20,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 614 flow [2021-12-14 16:38:20,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 119 transitions, 584 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-12-14 16:38:20,213 INFO L242 Difference]: Finished difference. Result has 120 places, 86 transitions, 316 flow [2021-12-14 16:38:20,213 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=316, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2021-12-14 16:38:20,214 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 24 predicate places. [2021-12-14 16:38:20,215 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 316 flow [2021-12-14 16:38:20,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 0 states have call successors, (0), 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-14 16:38:20,215 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:20,215 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] [2021-12-14 16:38:20,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:38:20,216 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:20,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2075845646, now seen corresponding path program 2 times [2021-12-14 16:38:20,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:20,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107639814] [2021-12-14 16:38:20,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:20,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:20,414 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-14 16:38:20,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:20,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107639814] [2021-12-14 16:38:20,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107639814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:20,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:20,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:38:20,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671252551] [2021-12-14 16:38:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:20,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:38:20,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:38:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:38:20,418 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2021-12-14 16:38:20,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 86 transitions, 316 flow. Second operand has 11 states, 11 states have (on average 71.36363636363636) internal successors, (785), 11 states have internal predecessors, (785), 0 states have call successors, (0), 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-14 16:38:20,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:20,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2021-12-14 16:38:20,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:20,626 INFO L129 PetriNetUnfolder]: 96/314 cut-off events. [2021-12-14 16:38:20,626 INFO L130 PetriNetUnfolder]: For 1606/1669 co-relation queries the response was YES. [2021-12-14 16:38:20,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 314 events. 96/314 cut-off events. For 1606/1669 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1205 event pairs, 28 based on Foata normal form. 12/316 useless extension candidates. Maximal degree in co-relation 1181. Up to 107 conditions per place. [2021-12-14 16:38:20,628 INFO L132 encePairwiseOnDemand]: 83/93 looper letters, 21 selfloop transitions, 8 changer transitions 19/109 dead transitions. [2021-12-14 16:38:20,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 630 flow [2021-12-14 16:38:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:38:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:38:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 955 transitions. [2021-12-14 16:38:20,631 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7899090157154673 [2021-12-14 16:38:20,631 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 955 transitions. [2021-12-14 16:38:20,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 955 transitions. [2021-12-14 16:38:20,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:20,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 955 transitions. [2021-12-14 16:38:20,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 73.46153846153847) internal successors, (955), 13 states have internal predecessors, (955), 0 states have call successors, (0), 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-14 16:38:20,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 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-14 16:38:20,635 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 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-14 16:38:20,635 INFO L186 Difference]: Start difference. First operand has 120 places, 86 transitions, 316 flow. Second operand 13 states and 955 transitions. [2021-12-14 16:38:20,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 109 transitions, 630 flow [2021-12-14 16:38:20,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 579 flow, removed 22 selfloop flow, removed 7 redundant places. [2021-12-14 16:38:20,640 INFO L242 Difference]: Finished difference. Result has 123 places, 86 transitions, 323 flow [2021-12-14 16:38:20,640 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=323, PETRI_PLACES=123, PETRI_TRANSITIONS=86} [2021-12-14 16:38:20,641 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2021-12-14 16:38:20,641 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 86 transitions, 323 flow [2021-12-14 16:38:20,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.36363636363636) internal successors, (785), 11 states have internal predecessors, (785), 0 states have call successors, (0), 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-14 16:38:20,641 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:20,642 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] [2021-12-14 16:38:20,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:38:20,642 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash -675902887, now seen corresponding path program 1 times [2021-12-14 16:38:20,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:20,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972084448] [2021-12-14 16:38:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:20,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:20,755 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-14 16:38:20,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:20,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972084448] [2021-12-14 16:38:20,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972084448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:20,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:20,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:20,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938577558] [2021-12-14 16:38:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:20,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:20,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:20,758 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-14 16:38:20,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 86 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 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-14 16:38:20,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:20,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-14 16:38:20,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:20,928 INFO L129 PetriNetUnfolder]: 118/404 cut-off events. [2021-12-14 16:38:20,928 INFO L130 PetriNetUnfolder]: For 2054/2111 co-relation queries the response was YES. [2021-12-14 16:38:20,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 404 events. 118/404 cut-off events. For 2054/2111 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1889 event pairs, 39 based on Foata normal form. 9/395 useless extension candidates. Maximal degree in co-relation 1524. Up to 114 conditions per place. [2021-12-14 16:38:20,931 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 28 selfloop transitions, 3 changer transitions 19/114 dead transitions. [2021-12-14 16:38:20,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 114 transitions, 692 flow [2021-12-14 16:38:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:38:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:38:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 702 transitions. [2021-12-14 16:38:20,933 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8387096774193549 [2021-12-14 16:38:20,933 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 702 transitions. [2021-12-14 16:38:20,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 702 transitions. [2021-12-14 16:38:20,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:20,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 702 transitions. [2021-12-14 16:38:20,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.0) internal successors, (702), 9 states have internal predecessors, (702), 0 states have call successors, (0), 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-14 16:38:20,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:20,936 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:20,936 INFO L186 Difference]: Start difference. First operand has 123 places, 86 transitions, 323 flow. Second operand 9 states and 702 transitions. [2021-12-14 16:38:20,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 114 transitions, 692 flow [2021-12-14 16:38:20,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 114 transitions, 605 flow, removed 37 selfloop flow, removed 14 redundant places. [2021-12-14 16:38:20,941 INFO L242 Difference]: Finished difference. Result has 118 places, 86 transitions, 307 flow [2021-12-14 16:38:20,941 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2021-12-14 16:38:20,942 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2021-12-14 16:38:20,942 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 307 flow [2021-12-14 16:38:20,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 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-14 16:38:20,942 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:20,943 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] [2021-12-14 16:38:20,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:38:20,943 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1393558538, now seen corresponding path program 1 times [2021-12-14 16:38:20,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:20,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017015058] [2021-12-14 16:38:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:20,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:21,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-14 16:38:21,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017015058] [2021-12-14 16:38:21,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017015058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:21,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:21,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:38:21,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222297960] [2021-12-14 16:38:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:21,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:38:21,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:38:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:38:21,060 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-14 16:38:21,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 307 flow. Second operand has 8 states, 8 states have (on average 73.75) internal successors, (590), 8 states have internal predecessors, (590), 0 states have call successors, (0), 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-14 16:38:21,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:21,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-14 16:38:21,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:21,270 INFO L129 PetriNetUnfolder]: 90/366 cut-off events. [2021-12-14 16:38:21,270 INFO L130 PetriNetUnfolder]: For 1598/1705 co-relation queries the response was YES. [2021-12-14 16:38:21,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 366 events. 90/366 cut-off events. For 1598/1705 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1781 event pairs, 17 based on Foata normal form. 14/358 useless extension candidates. Maximal degree in co-relation 1257. Up to 101 conditions per place. [2021-12-14 16:38:21,274 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 23 selfloop transitions, 8 changer transitions 19/113 dead transitions. [2021-12-14 16:38:21,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 660 flow [2021-12-14 16:38:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:38:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-14 16:38:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 837 transitions. [2021-12-14 16:38:21,277 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2021-12-14 16:38:21,277 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 837 transitions. [2021-12-14 16:38:21,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 837 transitions. [2021-12-14 16:38:21,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:21,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 837 transitions. [2021-12-14 16:38:21,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 76.0909090909091) internal successors, (837), 11 states have internal predecessors, (837), 0 states have call successors, (0), 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-14 16:38:21,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 0 states have call successors, (0), 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-14 16:38:21,282 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 0 states have call successors, (0), 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-14 16:38:21,282 INFO L186 Difference]: Start difference. First operand has 118 places, 86 transitions, 307 flow. Second operand 11 states and 837 transitions. [2021-12-14 16:38:21,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 660 flow [2021-12-14 16:38:21,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 611 flow, removed 23 selfloop flow, removed 7 redundant places. [2021-12-14 16:38:21,288 INFO L242 Difference]: Finished difference. Result has 122 places, 88 transitions, 358 flow [2021-12-14 16:38:21,288 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=358, PETRI_PLACES=122, PETRI_TRANSITIONS=88} [2021-12-14 16:38:21,289 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2021-12-14 16:38:21,289 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 88 transitions, 358 flow [2021-12-14 16:38:21,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.75) internal successors, (590), 8 states have internal predecessors, (590), 0 states have call successors, (0), 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-14 16:38:21,290 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:21,290 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] [2021-12-14 16:38:21,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:38:21,291 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash -751879984, now seen corresponding path program 1 times [2021-12-14 16:38:21,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:21,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589288276] [2021-12-14 16:38:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:21,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:21,392 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-14 16:38:21,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:21,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589288276] [2021-12-14 16:38:21,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589288276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:21,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:21,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:21,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859279479] [2021-12-14 16:38:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:21,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:21,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:21,395 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-14 16:38:21,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 88 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:21,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-14 16:38:21,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:21,616 INFO L129 PetriNetUnfolder]: 299/798 cut-off events. [2021-12-14 16:38:21,617 INFO L130 PetriNetUnfolder]: For 5782/5857 co-relation queries the response was YES. [2021-12-14 16:38:21,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 798 events. 299/798 cut-off events. For 5782/5857 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4801 event pairs, 19 based on Foata normal form. 52/821 useless extension candidates. Maximal degree in co-relation 2828. Up to 176 conditions per place. [2021-12-14 16:38:21,621 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 30 selfloop transitions, 5 changer transitions 50/149 dead transitions. [2021-12-14 16:38:21,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 149 transitions, 1029 flow [2021-12-14 16:38:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:38:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:38:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 784 transitions. [2021-12-14 16:38:21,623 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.843010752688172 [2021-12-14 16:38:21,623 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 784 transitions. [2021-12-14 16:38:21,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 784 transitions. [2021-12-14 16:38:21,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:21,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 784 transitions. [2021-12-14 16:38:21,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.4) internal successors, (784), 10 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,627 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,628 INFO L186 Difference]: Start difference. First operand has 122 places, 88 transitions, 358 flow. Second operand 10 states and 784 transitions. [2021-12-14 16:38:21,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 149 transitions, 1029 flow [2021-12-14 16:38:21,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 989 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-12-14 16:38:21,635 INFO L242 Difference]: Finished difference. Result has 124 places, 88 transitions, 372 flow [2021-12-14 16:38:21,635 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=372, PETRI_PLACES=124, PETRI_TRANSITIONS=88} [2021-12-14 16:38:21,637 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 28 predicate places. [2021-12-14 16:38:21,637 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 88 transitions, 372 flow [2021-12-14 16:38:21,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,638 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:21,638 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] [2021-12-14 16:38:21,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:38:21,639 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash 638868166, now seen corresponding path program 1 times [2021-12-14 16:38:21,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:21,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569907179] [2021-12-14 16:38:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:21,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:21,728 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-14 16:38:21,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:21,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569907179] [2021-12-14 16:38:21,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569907179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:21,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:21,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:38:21,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091325125] [2021-12-14 16:38:21,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:21,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:38:21,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:21,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:38:21,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:38:21,731 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-14 16:38:21,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 88 transitions, 372 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:21,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-14 16:38:21,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:21,850 INFO L129 PetriNetUnfolder]: 60/276 cut-off events. [2021-12-14 16:38:21,850 INFO L130 PetriNetUnfolder]: For 1484/1492 co-relation queries the response was YES. [2021-12-14 16:38:21,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 276 events. 60/276 cut-off events. For 1484/1492 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1133 event pairs, 3 based on Foata normal form. 21/294 useless extension candidates. Maximal degree in co-relation 917. Up to 48 conditions per place. [2021-12-14 16:38:21,852 INFO L132 encePairwiseOnDemand]: 85/93 looper letters, 18 selfloop transitions, 7 changer transitions 26/112 dead transitions. [2021-12-14 16:38:21,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 112 transitions, 696 flow [2021-12-14 16:38:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:38:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:38:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 761 transitions. [2021-12-14 16:38:21,854 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8182795698924731 [2021-12-14 16:38:21,854 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 761 transitions. [2021-12-14 16:38:21,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 761 transitions. [2021-12-14 16:38:21,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:21,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 761 transitions. [2021-12-14 16:38:21,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.1) internal successors, (761), 10 states have internal predecessors, (761), 0 states have call successors, (0), 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-14 16:38:21,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,857 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,857 INFO L186 Difference]: Start difference. First operand has 124 places, 88 transitions, 372 flow. Second operand 10 states and 761 transitions. [2021-12-14 16:38:21,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 112 transitions, 696 flow [2021-12-14 16:38:21,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 487 flow, removed 97 selfloop flow, removed 18 redundant places. [2021-12-14 16:38:21,862 INFO L242 Difference]: Finished difference. Result has 115 places, 82 transitions, 271 flow [2021-12-14 16:38:21,863 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=271, PETRI_PLACES=115, PETRI_TRANSITIONS=82} [2021-12-14 16:38:21,863 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2021-12-14 16:38:21,863 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 82 transitions, 271 flow [2021-12-14 16:38:21,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:21,864 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:21,864 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] [2021-12-14 16:38:21,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:38:21,864 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1478007344, now seen corresponding path program 1 times [2021-12-14 16:38:21,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:21,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426436591] [2021-12-14 16:38:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:21,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:22,127 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-14 16:38:22,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:22,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426436591] [2021-12-14 16:38:22,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426436591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:22,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:22,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 16:38:22,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321050406] [2021-12-14 16:38:22,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:22,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 16:38:22,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:22,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 16:38:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-14 16:38:22,130 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 93 [2021-12-14 16:38:22,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 82 transitions, 271 flow. Second operand has 14 states, 14 states have (on average 66.64285714285714) internal successors, (933), 14 states have internal predecessors, (933), 0 states have call successors, (0), 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-14 16:38:22,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:22,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 93 [2021-12-14 16:38:22,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:22,332 INFO L129 PetriNetUnfolder]: 5/120 cut-off events. [2021-12-14 16:38:22,332 INFO L130 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2021-12-14 16:38:22,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 120 events. 5/120 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 0 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 217. Up to 12 conditions per place. [2021-12-14 16:38:22,333 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 18 selfloop transitions, 8 changer transitions 9/90 dead transitions. [2021-12-14 16:38:22,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 90 transitions, 367 flow [2021-12-14 16:38:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:38:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:38:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 880 transitions. [2021-12-14 16:38:22,335 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727874276261373 [2021-12-14 16:38:22,335 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 880 transitions. [2021-12-14 16:38:22,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 880 transitions. [2021-12-14 16:38:22,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:22,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 880 transitions. [2021-12-14 16:38:22,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 67.6923076923077) internal successors, (880), 13 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:22,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 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-14 16:38:22,340 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 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-14 16:38:22,340 INFO L186 Difference]: Start difference. First operand has 115 places, 82 transitions, 271 flow. Second operand 13 states and 880 transitions. [2021-12-14 16:38:22,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 90 transitions, 367 flow [2021-12-14 16:38:22,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 90 transitions, 301 flow, removed 18 selfloop flow, removed 19 redundant places. [2021-12-14 16:38:22,342 INFO L242 Difference]: Finished difference. Result has 106 places, 80 transitions, 222 flow [2021-12-14 16:38:22,343 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=222, PETRI_PLACES=106, PETRI_TRANSITIONS=80} [2021-12-14 16:38:22,344 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2021-12-14 16:38:22,344 INFO L470 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 222 flow [2021-12-14 16:38:22,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.64285714285714) internal successors, (933), 14 states have internal predecessors, (933), 0 states have call successors, (0), 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-14 16:38:22,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:22,345 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] [2021-12-14 16:38:22,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:38:22,345 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:38:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 758801532, now seen corresponding path program 2 times [2021-12-14 16:38:22,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:22,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877793213] [2021-12-14 16:38:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:22,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:38:22,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:38:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:38:22,457 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:38:22,458 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:38:22,458 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-14 16:38:22,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-14 16:38:22,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2021-12-14 16:38:22,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2021-12-14 16:38:22,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-14 16:38:22,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:38:22,463 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:38:22,472 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-14 16:38:22,472 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:38:22,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:38:22 BasicIcfg [2021-12-14 16:38:22,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:38:22,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:38:22,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:38:22,529 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:38:22,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:38:18" (3/4) ... [2021-12-14 16:38:22,530 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:38:22,616 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:38:22,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:38:22,617 INFO L158 Benchmark]: Toolchain (without parser) took 5523.70ms. Allocated memory was 88.1MB in the beginning and 203.4MB in the end (delta: 115.3MB). Free memory was 54.2MB in the beginning and 140.7MB in the end (delta: -86.5MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2021-12-14 16:38:22,617 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:38:22,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.36ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 73.4MB in the end (delta: -19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 16:38:22,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.13ms. Allocated memory is still 111.1MB. Free memory was 73.4MB in the beginning and 70.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 16:38:22,618 INFO L158 Benchmark]: Boogie Preprocessor took 48.90ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:38:22,618 INFO L158 Benchmark]: RCFGBuilder took 700.48ms. Allocated memory is still 111.1MB. Free memory was 68.7MB in the beginning and 48.3MB in the end (delta: 20.4MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2021-12-14 16:38:22,619 INFO L158 Benchmark]: TraceAbstraction took 4164.27ms. Allocated memory was 111.1MB in the beginning and 203.4MB in the end (delta: 92.3MB). Free memory was 47.7MB in the beginning and 158.6MB in the end (delta: -110.9MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2021-12-14 16:38:22,619 INFO L158 Benchmark]: Witness Printer took 87.80ms. Allocated memory is still 203.4MB. Free memory was 158.6MB in the beginning and 140.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-14 16:38:22,621 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.18ms. Allocated memory is still 88.1MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.36ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 73.4MB in the end (delta: -19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.13ms. Allocated memory is still 111.1MB. Free memory was 73.4MB in the beginning and 70.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.90ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 700.48ms. Allocated memory is still 111.1MB. Free memory was 68.7MB in the beginning and 48.3MB in the end (delta: 20.4MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4164.27ms. Allocated memory was 111.1MB in the beginning and 203.4MB in the end (delta: 92.3MB). Free memory was 47.7MB in the beginning and 158.6MB in the end (delta: -110.9MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * Witness Printer took 87.80ms. Allocated memory is still 203.4MB. Free memory was 158.6MB in the beginning and 140.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 422 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 903 IncrementalHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 87 mSDtfsCounter, 903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=8, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 628 ConstructedInterpolants, 0 QuantifiedInterpolants, 3131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 16:38:22,654 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