./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:04:51,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:04:51,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:04:51,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:04:51,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:04:51,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:04:51,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:04:51,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:04:51,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:04:51,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:04:51,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:04:51,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:04:51,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:04:51,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:04:51,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:04:51,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:04:51,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:04:51,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:04:51,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:04:51,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:04:51,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:04:51,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:04:51,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:04:51,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:04:51,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:04:51,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:04:51,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:04:51,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:04:51,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:04:51,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:04:51,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:04:51,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:04:51,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:04:51,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:04:51,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:04:51,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:04:51,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:04:51,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:04:51,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:04:51,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:04:51,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:04:51,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:04:51,534 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:04:51,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:04:51,535 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:04:51,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:04:51,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:04:51,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:04:51,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:04:51,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:04:51,537 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:04:51,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:04:51,538 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:04:51,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:04:51,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:04:51,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:04:51,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:04:51,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:04:51,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:04:51,539 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:04:51,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:04:51,539 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:04:51,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:04:51,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:04:51,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:04:51,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:04:51,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:04:51,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:04:51,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:04:51,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:04:51,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:04:51,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:04:51,541 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:04:51,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:04:51,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:04:51,541 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:04:51,541 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2021-12-21 15:04:51,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:04:51,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:04:51,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:04:51,777 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:04:51,779 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:04:51,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-21 15:04:51,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff02cce04/9a3c1d4d7d7944739c6c9a8aa5f181e5/FLAG771a14c06 [2021-12-21 15:04:52,264 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:04:52,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-21 15:04:52,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff02cce04/9a3c1d4d7d7944739c6c9a8aa5f181e5/FLAG771a14c06 [2021-12-21 15:04:52,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff02cce04/9a3c1d4d7d7944739c6c9a8aa5f181e5 [2021-12-21 15:04:52,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:04:52,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:04:52,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:04:52,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:04:52,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:04:52,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bafec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52, skipping insertion in model container [2021-12-21 15:04:52,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:04:52,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:04:52,449 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2021-12-21 15:04:52,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:04:52,581 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:04:52,593 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2021-12-21 15:04:52,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:04:52,676 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:04:52,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52 WrapperNode [2021-12-21 15:04:52,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:04:52,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:04:52,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:04:52,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:04:52,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,716 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2021-12-21 15:04:52,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:04:52,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:04:52,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:04:52,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:04:52,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:04:52,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:04:52,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:04:52,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:04:52,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (1/1) ... [2021-12-21 15:04:52,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:04:52,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:04:52,792 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-21 15:04:52,798 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-21 15:04:52,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:04:52,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:04:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:04:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:04:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:04:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-21 15:04:52,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-21 15:04:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-21 15:04:52,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-21 15:04:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:04:52,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:04:52,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:04:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:04:52,827 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:04:52,929 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:04:52,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:04:53,305 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:04:53,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:04:53,609 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:04:53,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:04:53 BoogieIcfgContainer [2021-12-21 15:04:53,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:04:53,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:04:53,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:04:53,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:04:53,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:04:52" (1/3) ... [2021-12-21 15:04:53,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9543eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:04:53, skipping insertion in model container [2021-12-21 15:04:53,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:04:52" (2/3) ... [2021-12-21 15:04:53,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9543eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:04:53, skipping insertion in model container [2021-12-21 15:04:53,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:04:53" (3/3) ... [2021-12-21 15:04:53,619 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-21 15:04:53,623 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:04:53,623 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:04:53,623 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 15:04:53,623 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:04:53,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,660 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,661 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,661 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,662 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,663 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,663 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,663 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,663 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,669 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,672 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,672 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,672 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,672 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,680 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,680 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,681 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,681 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,681 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,681 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,681 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,681 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,682 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,682 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,682 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,682 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,683 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,684 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:04:53,685 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 15:04:53,732 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:04:53,738 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-21 15:04:53,738 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-21 15:04:53,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2021-12-21 15:04:53,782 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-12-21 15:04:53,782 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:04:53,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2021-12-21 15:04:53,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2021-12-21 15:04:53,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2021-12-21 15:04:53,819 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-12-21 15:04:53,820 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:04:53,820 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:53,820 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] [2021-12-21 15:04:53,821 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash -590582846, now seen corresponding path program 1 times [2021-12-21 15:04:53,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:53,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196198148] [2021-12-21 15:04:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:53,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:04:54,032 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-21 15:04:54,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:04:54,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196198148] [2021-12-21 15:04:54,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196198148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:04:54,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:04:54,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:04:54,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424220350] [2021-12-21 15:04:54,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:04:54,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:04:54,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:04:54,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:04:54,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:04:54,070 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2021-12-21 15:04:54,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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-21 15:04:54,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:04:54,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2021-12-21 15:04:54,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:04:54,152 INFO L129 PetriNetUnfolder]: 17/160 cut-off events. [2021-12-21 15:04:54,152 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-21 15:04:54,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 160 events. 17/160 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 394 event pairs, 3 based on Foata normal form. 6/158 useless extension candidates. Maximal degree in co-relation 161. Up to 27 conditions per place. [2021-12-21 15:04:54,155 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 9 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-12-21 15:04:54,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 91 transitions, 210 flow [2021-12-21 15:04:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:04:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:04:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2021-12-21 15:04:54,170 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9290780141843972 [2021-12-21 15:04:54,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2021-12-21 15:04:54,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2021-12-21 15:04:54,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:04:54,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2021-12-21 15:04:54,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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-21 15:04:54,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 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-21 15:04:54,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 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-21 15:04:54,192 INFO L186 Difference]: Start difference. First operand has 97 places, 92 transitions, 190 flow. Second operand 3 states and 262 transitions. [2021-12-21 15:04:54,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 91 transitions, 210 flow [2021-12-21 15:04:54,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:04:54,199 INFO L242 Difference]: Finished difference. Result has 95 places, 88 transitions, 184 flow [2021-12-21 15:04:54,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2021-12-21 15:04:54,206 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2021-12-21 15:04:54,206 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 184 flow [2021-12-21 15:04:54,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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-21 15:04:54,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:54,208 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] [2021-12-21 15:04:54,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:04:54,208 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1655661633, now seen corresponding path program 1 times [2021-12-21 15:04:54,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124868581] [2021-12-21 15:04:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:54,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:04:54,479 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-21 15:04:54,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:04:54,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124868581] [2021-12-21 15:04:54,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124868581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:04:54,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:04:54,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:04:54,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469487104] [2021-12-21 15:04:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:04:54,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:04:54,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:04:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:04:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:04:54,483 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2021-12-21 15:04:54,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 184 flow. Second operand has 11 states, 11 states have (on average 72.27272727272727) internal successors, (795), 11 states have internal predecessors, (795), 0 states have call successors, (0), 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-21 15:04:54,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:04:54,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2021-12-21 15:04:54,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:04:54,808 INFO L129 PetriNetUnfolder]: 119/489 cut-off events. [2021-12-21 15:04:54,808 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-12-21 15:04:54,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 489 events. 119/489 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2584 event pairs, 52 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 715. Up to 125 conditions per place. [2021-12-21 15:04:54,810 INFO L132 encePairwiseOnDemand]: 82/94 looper letters, 16 selfloop transitions, 9 changer transitions 48/133 dead transitions. [2021-12-21 15:04:54,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 133 transitions, 418 flow [2021-12-21 15:04:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 15:04:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-21 15:04:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1203 transitions. [2021-12-21 15:04:54,813 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7998670212765957 [2021-12-21 15:04:54,813 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1203 transitions. [2021-12-21 15:04:54,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1203 transitions. [2021-12-21 15:04:54,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:04:54,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1203 transitions. [2021-12-21 15:04:54,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 75.1875) internal successors, (1203), 16 states have internal predecessors, (1203), 0 states have call successors, (0), 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-21 15:04:54,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 94.0) internal successors, (1598), 17 states have internal predecessors, (1598), 0 states have call successors, (0), 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-21 15:04:54,820 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 94.0) internal successors, (1598), 17 states have internal predecessors, (1598), 0 states have call successors, (0), 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-21 15:04:54,820 INFO L186 Difference]: Start difference. First operand has 95 places, 88 transitions, 184 flow. Second operand 16 states and 1203 transitions. [2021-12-21 15:04:54,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 133 transitions, 418 flow [2021-12-21 15:04:54,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 133 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:04:54,822 INFO L242 Difference]: Finished difference. Result has 119 places, 82 transitions, 234 flow [2021-12-21 15:04:54,822 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=234, PETRI_PLACES=119, PETRI_TRANSITIONS=82} [2021-12-21 15:04:54,823 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 22 predicate places. [2021-12-21 15:04:54,823 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 82 transitions, 234 flow [2021-12-21 15:04:54,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.27272727272727) internal successors, (795), 11 states have internal predecessors, (795), 0 states have call successors, (0), 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-21 15:04:54,823 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:54,824 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-21 15:04:54,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:04:54,824 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1482021231, now seen corresponding path program 1 times [2021-12-21 15:04:54,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865287313] [2021-12-21 15:04:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:54,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:04:55,005 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-21 15:04:55,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:04:55,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865287313] [2021-12-21 15:04:55,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865287313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:04:55,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:04:55,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:04:55,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432360995] [2021-12-21 15:04:55,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:04:55,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:04:55,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:04:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:04:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:04:55,009 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-21 15:04:55,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 82 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 74.44444444444444) internal successors, (670), 9 states have internal predecessors, (670), 0 states have call successors, (0), 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-21 15:04:55,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:04:55,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-21 15:04:55,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:04:55,234 INFO L129 PetriNetUnfolder]: 69/247 cut-off events. [2021-12-21 15:04:55,235 INFO L130 PetriNetUnfolder]: For 422/422 co-relation queries the response was YES. [2021-12-21 15:04:55,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 247 events. 69/247 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 857 event pairs, 13 based on Foata normal form. 6/247 useless extension candidates. Maximal degree in co-relation 618. Up to 80 conditions per place. [2021-12-21 15:04:55,237 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 20 selfloop transitions, 8 changer transitions 20/110 dead transitions. [2021-12-21 15:04:55,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 110 transitions, 478 flow [2021-12-21 15:04:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 15:04:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 15:04:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 924 transitions. [2021-12-21 15:04:55,240 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8191489361702128 [2021-12-21 15:04:55,240 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 924 transitions. [2021-12-21 15:04:55,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 924 transitions. [2021-12-21 15:04:55,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:04:55,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 924 transitions. [2021-12-21 15:04:55,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 77.0) internal successors, (924), 12 states have internal predecessors, (924), 0 states have call successors, (0), 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-21 15:04:55,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 94.0) internal successors, (1222), 13 states have internal predecessors, (1222), 0 states have call successors, (0), 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-21 15:04:55,244 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 94.0) internal successors, (1222), 13 states have internal predecessors, (1222), 0 states have call successors, (0), 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-21 15:04:55,244 INFO L186 Difference]: Start difference. First operand has 119 places, 82 transitions, 234 flow. Second operand 12 states and 924 transitions. [2021-12-21 15:04:55,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 110 transitions, 478 flow [2021-12-21 15:04:55,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 448 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-12-21 15:04:55,249 INFO L242 Difference]: Finished difference. Result has 113 places, 85 transitions, 275 flow [2021-12-21 15:04:55,249 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=275, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2021-12-21 15:04:55,250 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 16 predicate places. [2021-12-21 15:04:55,250 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 275 flow [2021-12-21 15:04:55,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.44444444444444) internal successors, (670), 9 states have internal predecessors, (670), 0 states have call successors, (0), 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-21 15:04:55,250 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:55,251 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-21 15:04:55,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:04:55,251 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:55,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1934211226, now seen corresponding path program 1 times [2021-12-21 15:04:55,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:55,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490483989] [2021-12-21 15:04:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:55,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:04:55,344 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-21 15:04:55,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:04:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490483989] [2021-12-21 15:04:55,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490483989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:04:55,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:04:55,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:04:55,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322764672] [2021-12-21 15:04:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:04:55,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:04:55,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:04:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:04:55,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:04:55,347 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-21 15:04:55,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 275 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-21 15:04:55,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:04:55,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-21 15:04:55,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:04:55,514 INFO L129 PetriNetUnfolder]: 147/432 cut-off events. [2021-12-21 15:04:55,515 INFO L130 PetriNetUnfolder]: For 749/755 co-relation queries the response was YES. [2021-12-21 15:04:55,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 432 events. 147/432 cut-off events. For 749/755 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1947 event pairs, 8 based on Foata normal form. 6/429 useless extension candidates. Maximal degree in co-relation 1119. Up to 86 conditions per place. [2021-12-21 15:04:55,517 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 27 selfloop transitions, 6 changer transitions 41/137 dead transitions. [2021-12-21 15:04:55,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 137 transitions, 702 flow [2021-12-21 15:04:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:04:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:04:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2021-12-21 15:04:55,520 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8446808510638298 [2021-12-21 15:04:55,520 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 794 transitions. [2021-12-21 15:04:55,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 794 transitions. [2021-12-21 15:04:55,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:04:55,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 794 transitions. [2021-12-21 15:04:55,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.4) internal successors, (794), 10 states have internal predecessors, (794), 0 states have call successors, (0), 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-21 15:04:55,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 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-21 15:04:55,523 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 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-21 15:04:55,523 INFO L186 Difference]: Start difference. First operand has 113 places, 85 transitions, 275 flow. Second operand 10 states and 794 transitions. [2021-12-21 15:04:55,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 137 transitions, 702 flow [2021-12-21 15:04:55,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 137 transitions, 596 flow, removed 42 selfloop flow, removed 12 redundant places. [2021-12-21 15:04:55,527 INFO L242 Difference]: Finished difference. Result has 110 places, 87 transitions, 280 flow [2021-12-21 15:04:55,528 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=110, PETRI_TRANSITIONS=87} [2021-12-21 15:04:55,528 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 13 predicate places. [2021-12-21 15:04:55,528 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 87 transitions, 280 flow [2021-12-21 15:04:55,529 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-21 15:04:55,529 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:55,529 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-21 15:04:55,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:04:55,529 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:55,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1416261843, now seen corresponding path program 1 times [2021-12-21 15:04:55,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:55,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310335385] [2021-12-21 15:04:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:55,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:04:55,647 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-21 15:04:55,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:04:55,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310335385] [2021-12-21 15:04:55,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310335385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:04:55,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:04:55,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:04:55,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491546165] [2021-12-21 15:04:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:04:55,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:04:55,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:04:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:04:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:04:55,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-21 15:04:55,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 87 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 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-21 15:04:55,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:04:55,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-21 15:04:55,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:04:55,786 INFO L129 PetriNetUnfolder]: 49/225 cut-off events. [2021-12-21 15:04:55,786 INFO L130 PetriNetUnfolder]: For 280/282 co-relation queries the response was YES. [2021-12-21 15:04:55,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 225 events. 49/225 cut-off events. For 280/282 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 775 event pairs, 10 based on Foata normal form. 9/231 useless extension candidates. Maximal degree in co-relation 567. Up to 36 conditions per place. [2021-12-21 15:04:55,787 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 23 selfloop transitions, 9 changer transitions 15/110 dead transitions. [2021-12-21 15:04:55,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 110 transitions, 505 flow [2021-12-21 15:04:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:04:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:04:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 848 transitions. [2021-12-21 15:04:55,790 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8201160541586073 [2021-12-21 15:04:55,790 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 848 transitions. [2021-12-21 15:04:55,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 848 transitions. [2021-12-21 15:04:55,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:04:55,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 848 transitions. [2021-12-21 15:04:55,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.0909090909091) internal successors, (848), 11 states have internal predecessors, (848), 0 states have call successors, (0), 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-21 15:04:55,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 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-21 15:04:55,795 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 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-21 15:04:55,795 INFO L186 Difference]: Start difference. First operand has 110 places, 87 transitions, 280 flow. Second operand 11 states and 848 transitions. [2021-12-21 15:04:55,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 110 transitions, 505 flow [2021-12-21 15:04:55,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 429 flow, removed 30 selfloop flow, removed 9 redundant places. [2021-12-21 15:04:55,799 INFO L242 Difference]: Finished difference. Result has 114 places, 90 transitions, 301 flow [2021-12-21 15:04:55,799 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=301, PETRI_PLACES=114, PETRI_TRANSITIONS=90} [2021-12-21 15:04:55,801 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 17 predicate places. [2021-12-21 15:04:55,801 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 301 flow [2021-12-21 15:04:55,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 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-21 15:04:55,802 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:55,802 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:04:55,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:04:55,802 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash -259826830, now seen corresponding path program 1 times [2021-12-21 15:04:55,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:55,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909291683] [2021-12-21 15:04:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:55,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:04:56,002 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-21 15:04:56,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:04:56,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909291683] [2021-12-21 15:04:56,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909291683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:04:56,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:04:56,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:04:56,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478021442] [2021-12-21 15:04:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:04:56,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:04:56,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:04:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:04:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:04:56,005 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-21 15:04:56,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 0 states have call successors, (0), 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-21 15:04:56,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:04:56,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-21 15:04:56,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:04:56,128 INFO L129 PetriNetUnfolder]: 17/230 cut-off events. [2021-12-21 15:04:56,129 INFO L130 PetriNetUnfolder]: For 245/251 co-relation queries the response was YES. [2021-12-21 15:04:56,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 230 events. 17/230 cut-off events. For 245/251 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 999 event pairs, 1 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 483. Up to 37 conditions per place. [2021-12-21 15:04:56,130 INFO L132 encePairwiseOnDemand]: 88/94 looper letters, 17 selfloop transitions, 1 changer transitions 15/102 dead transitions. [2021-12-21 15:04:56,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 102 transitions, 404 flow [2021-12-21 15:04:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:04:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:04:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 539 transitions. [2021-12-21 15:04:56,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8191489361702128 [2021-12-21 15:04:56,132 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 539 transitions. [2021-12-21 15:04:56,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 539 transitions. [2021-12-21 15:04:56,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:04:56,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 539 transitions. [2021-12-21 15:04:56,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 0 states have call successors, (0), 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-21 15:04:56,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 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-21 15:04:56,134 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 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-21 15:04:56,134 INFO L186 Difference]: Start difference. First operand has 114 places, 90 transitions, 301 flow. Second operand 7 states and 539 transitions. [2021-12-21 15:04:56,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 102 transitions, 404 flow [2021-12-21 15:04:56,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 377 flow, removed 10 selfloop flow, removed 7 redundant places. [2021-12-21 15:04:56,137 INFO L242 Difference]: Finished difference. Result has 115 places, 86 transitions, 269 flow [2021-12-21 15:04:56,137 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=115, PETRI_TRANSITIONS=86} [2021-12-21 15:04:56,138 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 18 predicate places. [2021-12-21 15:04:56,138 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 86 transitions, 269 flow [2021-12-21 15:04:56,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 0 states have call successors, (0), 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-21 15:04:56,138 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:56,139 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:04:56,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:04:56,139 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash -795551214, now seen corresponding path program 2 times [2021-12-21 15:04:56,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:56,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951034125] [2021-12-21 15:04:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:56,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:04:56,397 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-21 15:04:56,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:04:56,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951034125] [2021-12-21 15:04:56,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951034125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:04:56,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:04:56,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 15:04:56,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962106884] [2021-12-21 15:04:56,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:04:56,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 15:04:56,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:04:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 15:04:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:04:56,400 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 94 [2021-12-21 15:04:56,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 86 transitions, 269 flow. Second operand has 12 states, 12 states have (on average 71.58333333333333) internal successors, (859), 12 states have internal predecessors, (859), 0 states have call successors, (0), 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-21 15:04:56,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:04:56,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 94 [2021-12-21 15:04:56,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:04:56,598 INFO L129 PetriNetUnfolder]: 9/229 cut-off events. [2021-12-21 15:04:56,598 INFO L130 PetriNetUnfolder]: For 128/130 co-relation queries the response was YES. [2021-12-21 15:04:56,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 229 events. 9/229 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1070 event pairs, 0 based on Foata normal form. 3/225 useless extension candidates. Maximal degree in co-relation 461. Up to 29 conditions per place. [2021-12-21 15:04:56,599 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 21 selfloop transitions, 6 changer transitions 13/100 dead transitions. [2021-12-21 15:04:56,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 100 transitions, 387 flow [2021-12-21 15:04:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:04:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:04:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 806 transitions. [2021-12-21 15:04:56,601 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7794970986460348 [2021-12-21 15:04:56,601 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 806 transitions. [2021-12-21 15:04:56,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 806 transitions. [2021-12-21 15:04:56,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:04:56,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 806 transitions. [2021-12-21 15:04:56,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 73.27272727272727) internal successors, (806), 11 states have internal predecessors, (806), 0 states have call successors, (0), 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-21 15:04:56,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 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-21 15:04:56,605 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 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-21 15:04:56,605 INFO L186 Difference]: Start difference. First operand has 115 places, 86 transitions, 269 flow. Second operand 11 states and 806 transitions. [2021-12-21 15:04:56,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 100 transitions, 387 flow [2021-12-21 15:04:56,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 100 transitions, 356 flow, removed 14 selfloop flow, removed 7 redundant places. [2021-12-21 15:04:56,608 INFO L242 Difference]: Finished difference. Result has 117 places, 81 transitions, 251 flow [2021-12-21 15:04:56,608 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=251, PETRI_PLACES=117, PETRI_TRANSITIONS=81} [2021-12-21 15:04:56,609 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 20 predicate places. [2021-12-21 15:04:56,609 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 81 transitions, 251 flow [2021-12-21 15:04:56,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 71.58333333333333) internal successors, (859), 12 states have internal predecessors, (859), 0 states have call successors, (0), 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-21 15:04:56,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:04:56,610 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:04:56,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:04:56,610 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:04:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:04:56,629 INFO L85 PathProgramCache]: Analyzing trace with hash 231948946, now seen corresponding path program 3 times [2021-12-21 15:04:56,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:04:56,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613236490] [2021-12-21 15:04:56,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:04:56,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:04:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:04:56,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 15:04:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:04:56,717 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 15:04:56,718 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 15:04:56,718 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-21 15:04:56,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-21 15:04:56,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2021-12-21 15:04:56,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2021-12-21 15:04:56,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-21 15:04:56,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:04:56,723 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2021-12-21 15:04:56,726 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 15:04:56,727 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:04:56,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:04:56 BasicIcfg [2021-12-21 15:04:56,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:04:56,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:04:56,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:04:56,811 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:04:56,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:04:53" (3/4) ... [2021-12-21 15:04:56,812 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 15:04:56,871 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:04:56,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:04:56,872 INFO L158 Benchmark]: Toolchain (without parser) took 4581.98ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 88.6MB in the beginning and 106.8MB in the end (delta: -18.2MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2021-12-21 15:04:56,872 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:04:56,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.11ms. Allocated memory is still 115.3MB. Free memory was 88.2MB in the beginning and 76.9MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 15:04:56,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.28ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 15:04:56,873 INFO L158 Benchmark]: Boogie Preprocessor took 33.10ms. Allocated memory is still 115.3MB. Free memory was 74.0MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:04:56,873 INFO L158 Benchmark]: RCFGBuilder took 860.37ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 72.3MB in the beginning and 71.1MB in the end (delta: 1.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2021-12-21 15:04:56,873 INFO L158 Benchmark]: TraceAbstraction took 3196.81ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 70.2MB in the beginning and 124.7MB in the end (delta: -54.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2021-12-21 15:04:56,873 INFO L158 Benchmark]: Witness Printer took 60.74ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 106.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-21 15:04:56,875 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.19ms. Allocated memory is still 115.3MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.11ms. Allocated memory is still 115.3MB. Free memory was 88.2MB in the beginning and 76.9MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.28ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.10ms. Allocated memory is still 115.3MB. Free memory was 74.0MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 860.37ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 72.3MB in the beginning and 71.1MB in the end (delta: 1.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3196.81ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 70.2MB in the beginning and 124.7MB in the end (delta: -54.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Witness Printer took 60.74ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 106.8MB in the end (delta: 17.8MB). 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] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L716] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L717] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L718] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L719] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L720] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L721] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L722] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L723] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L724] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L725] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L726] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L727] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L728] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-1, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 795]: 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, 112 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: 3.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 277 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 53 mSDtfsCounter, 662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=5, InterpolantAutomatonStates: 70, 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, 0.9s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-21 15:04:56,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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