./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 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/safe026_power.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 83f968ee49ccba0b79a39d05c84ef94d26b78e5a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-96f1638 [2020-12-02 12:11:09,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 12:11:09,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 12:11:09,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 12:11:09,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 12:11:09,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 12:11:09,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 12:11:09,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 12:11:09,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 12:11:09,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 12:11:09,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 12:11:09,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 12:11:09,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 12:11:09,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 12:11:09,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 12:11:09,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 12:11:09,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 12:11:09,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 12:11:09,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 12:11:09,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 12:11:09,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 12:11:09,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 12:11:09,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 12:11:09,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 12:11:09,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 12:11:09,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 12:11:09,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 12:11:09,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 12:11:09,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 12:11:09,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 12:11:09,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 12:11:09,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 12:11:09,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 12:11:09,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 12:11:09,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 12:11:09,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 12:11:09,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 12:11:09,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 12:11:09,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 12:11:09,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 12:11:09,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 12:11:09,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 12:11:09,859 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 12:11:09,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 12:11:09,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 12:11:09,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 12:11:09,865 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 12:11:09,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 12:11:09,865 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 12:11:09,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 12:11:09,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 12:11:09,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 12:11:09,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 12:11:09,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 12:11:09,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 12:11:09,868 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 12:11:09,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 12:11:09,868 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 12:11:09,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 12:11:09,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 12:11:09,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 12:11:09,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 12:11:09,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 12:11:09,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:11:09,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 12:11:09,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 12:11:09,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 12:11:09,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 12:11:09,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 12:11:09,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 12:11:09,872 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 12:11:09,872 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 -> 83f968ee49ccba0b79a39d05c84ef94d26b78e5a [2020-12-02 12:11:10,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 12:11:10,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 12:11:10,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 12:11:10,350 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 12:11:10,351 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 12:11:10,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i [2020-12-02 12:11:10,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8257567/36c2fb2c43e14691b7c9b8690b7e40ae/FLAGd7ce65f4b [2020-12-02 12:11:11,187 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 12:11:11,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe026_power.opt.i [2020-12-02 12:11:11,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8257567/36c2fb2c43e14691b7c9b8690b7e40ae/FLAGd7ce65f4b [2020-12-02 12:11:11,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8257567/36c2fb2c43e14691b7c9b8690b7e40ae [2020-12-02 12:11:11,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 12:11:11,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 12:11:11,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 12:11:11,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 12:11:11,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 12:11:11,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:11:11" (1/1) ... [2020-12-02 12:11:11,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d903063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:11, skipping insertion in model container [2020-12-02 12:11:11,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:11:11" (1/1) ... [2020-12-02 12:11:11,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 12:11:11,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 12:11:11,774 WARN L226 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/safe026_power.opt.i[951,964] [2020-12-02 12:11:12,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:11:12,089 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 12:11:12,103 WARN L226 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/safe026_power.opt.i[951,964] [2020-12-02 12:11:12,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:11:12,303 INFO L208 MainTranslator]: Completed translation [2020-12-02 12:11:12,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12 WrapperNode [2020-12-02 12:11:12,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 12:11:12,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 12:11:12,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 12:11:12,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 12:11:12,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 12:11:12,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 12:11:12,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 12:11:12,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 12:11:12,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... [2020-12-02 12:11:12,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 12:11:12,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 12:11:12,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 12:11:12,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 12:11:12,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:11:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 12:11:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 12:11:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 12:11:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 12:11:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 12:11:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 12:11:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 12:11:12,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 12:11:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 12:11:12,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 12:11:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 12:11:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 12:11:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 12:11:12,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 12:11:12,587 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 12:11:14,719 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 12:11:14,720 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 12:11:14,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:14 BoogieIcfgContainer [2020-12-02 12:11:14,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 12:11:14,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 12:11:14,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 12:11:14,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 12:11:14,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:11:11" (1/3) ... [2020-12-02 12:11:14,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832f93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:11:14, skipping insertion in model container [2020-12-02 12:11:14,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:12" (2/3) ... [2020-12-02 12:11:14,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832f93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:11:14, skipping insertion in model container [2020-12-02 12:11:14,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:14" (3/3) ... [2020-12-02 12:11:14,735 INFO L111 eAbstractionObserver]: Analyzing ICFG safe026_power.opt.i [2020-12-02 12:11:14,753 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 12:11:14,754 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 12:11:14,758 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 12:11:14,759 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 12:11:14,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,828 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,829 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,829 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,830 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,830 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,876 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,879 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,887 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,887 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,887 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,889 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:11:14,893 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 12:11:14,906 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-02 12:11:14,931 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 12:11:14,932 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 12:11:14,932 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 12:11:14,932 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 12:11:14,932 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 12:11:14,933 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 12:11:14,933 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 12:11:14,933 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 12:11:14,947 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 12:11:14,950 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow [2020-12-02 12:11:14,953 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 207 flow [2020-12-02 12:11:14,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-12-02 12:11:15,012 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-12-02 12:11:15,012 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 12:11:15,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-02 12:11:15,021 INFO L116 LiptonReduction]: Number of co-enabled transitions 1602 [2020-12-02 12:11:15,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,321 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:15,332 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:15,413 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:15,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:15,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:15,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:15,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:15,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:15,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:15,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,020 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,250 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:16,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:16,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:16,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:17,035 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 12:11:17,195 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 12:11:17,814 WARN L197 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-02 12:11:18,002 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-02 12:11:18,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:18,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:18,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:18,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:18,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:11:18,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:18,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:18,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:18,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:18,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:18,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:18,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:18,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:18,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:18,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:18,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:11:18,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:18,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:18,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:18,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:11:19,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:19,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:19,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:19,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:19,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:19,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:11:19,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:19,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:19,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:19,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:19,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:19,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:19,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:19,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:19,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:19,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 12:11:19,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:19,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:19,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:19,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:19,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:19,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:19,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:19,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:19,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:19,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:19,589 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-02 12:11:19,705 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-02 12:11:20,183 WARN L197 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-12-02 12:11:20,433 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-02 12:11:20,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:20,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:11:20,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:20,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:20,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:20,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:20,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:20,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:11:20,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:20,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:20,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:20,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:20,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:20,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:20,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:20,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:20,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:20,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:20,969 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:20,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:20,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:20,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:20,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:20,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:20,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:21,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:21,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:11:21,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:21,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:21,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:21,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:21,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:21,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:21,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:11:21,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:21,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:11:21,326 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 12:11:21,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:21,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:21,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:21,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:11:21,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:21,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:21,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:21,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:21,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:21,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:21,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 12:11:21,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:21,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:21,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:22,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 12:11:22,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:22,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:22,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:11:22,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:11:22,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:22,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:22,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:11:22,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:22,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 12:11:22,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:11:22,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:22,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:22,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:22,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:22,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:11:22,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:11:22,632 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-02 12:11:22,808 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-02 12:11:23,333 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-12-02 12:11:24,181 WARN L197 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-02 12:11:24,405 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 12:11:24,857 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-12-02 12:11:25,076 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 12:11:25,082 INFO L131 LiptonReduction]: Checked pairs total: 4221 [2020-12-02 12:11:25,082 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-02 12:11:25,090 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-12-02 12:11:25,153 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-12-02 12:11:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-12-02 12:11:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-02 12:11:25,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:25,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-02 12:11:25,164 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1054904, now seen corresponding path program 1 times [2020-12-02 12:11:25,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:25,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641205065] [2020-12-02 12:11:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:25,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641205065] [2020-12-02 12:11:25,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:25,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 12:11:25,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842969384] [2020-12-02 12:11:25,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 12:11:25,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 12:11:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:11:25,520 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-12-02 12:11:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:25,625 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-12-02 12:11:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 12:11:25,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-02 12:11:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:25,651 INFO L225 Difference]: With dead ends: 552 [2020-12-02 12:11:25,652 INFO L226 Difference]: Without dead ends: 452 [2020-12-02 12:11:25,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:11:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-12-02 12:11:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-12-02 12:11:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-12-02 12:11:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-12-02 12:11:25,744 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-12-02 12:11:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:25,745 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-12-02 12:11:25,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 12:11:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-12-02 12:11:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 12:11:25,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:25,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:25,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 12:11:25,748 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1421849972, now seen corresponding path program 1 times [2020-12-02 12:11:25,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:25,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096846524] [2020-12-02 12:11:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:25,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096846524] [2020-12-02 12:11:25,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:25,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 12:11:25,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207206023] [2020-12-02 12:11:25,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 12:11:25,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:25,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 12:11:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:11:25,880 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-12-02 12:11:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:25,906 INFO L93 Difference]: Finished difference Result 442 states and 1324 transitions. [2020-12-02 12:11:25,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 12:11:25,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-02 12:11:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:25,919 INFO L225 Difference]: With dead ends: 442 [2020-12-02 12:11:25,920 INFO L226 Difference]: Without dead ends: 442 [2020-12-02 12:11:25,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:11:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-12-02 12:11:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-12-02 12:11:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-12-02 12:11:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-12-02 12:11:25,973 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 9 [2020-12-02 12:11:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:25,975 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-12-02 12:11:25,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 12:11:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-12-02 12:11:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 12:11:25,978 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:25,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:25,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 12:11:25,979 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:25,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1127676382, now seen corresponding path program 1 times [2020-12-02 12:11:25,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:25,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662470000] [2020-12-02 12:11:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:26,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662470000] [2020-12-02 12:11:26,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:26,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:11:26,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961336378] [2020-12-02 12:11:26,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:11:26,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:11:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:11:26,113 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 4 states. [2020-12-02 12:11:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:26,157 INFO L93 Difference]: Finished difference Result 604 states and 1744 transitions. [2020-12-02 12:11:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 12:11:26,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-02 12:11:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:26,162 INFO L225 Difference]: With dead ends: 604 [2020-12-02 12:11:26,162 INFO L226 Difference]: Without dead ends: 523 [2020-12-02 12:11:26,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:11:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-12-02 12:11:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 487. [2020-12-02 12:11:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-12-02 12:11:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1426 transitions. [2020-12-02 12:11:26,183 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1426 transitions. Word has length 10 [2020-12-02 12:11:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:26,184 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 1426 transitions. [2020-12-02 12:11:26,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:11:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1426 transitions. [2020-12-02 12:11:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 12:11:26,187 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:26,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:26,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 12:11:26,188 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash 598207581, now seen corresponding path program 1 times [2020-12-02 12:11:26,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:26,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167474350] [2020-12-02 12:11:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:26,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167474350] [2020-12-02 12:11:26,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:26,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:11:26,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714866556] [2020-12-02 12:11:26,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:11:26,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:11:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:11:26,253 INFO L87 Difference]: Start difference. First operand 487 states and 1426 transitions. Second operand 4 states. [2020-12-02 12:11:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:26,284 INFO L93 Difference]: Finished difference Result 721 states and 2080 transitions. [2020-12-02 12:11:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 12:11:26,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-02 12:11:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:26,289 INFO L225 Difference]: With dead ends: 721 [2020-12-02 12:11:26,289 INFO L226 Difference]: Without dead ends: 427 [2020-12-02 12:11:26,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:11:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-12-02 12:11:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-12-02 12:11:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-12-02 12:11:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1227 transitions. [2020-12-02 12:11:26,308 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1227 transitions. Word has length 11 [2020-12-02 12:11:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:26,309 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1227 transitions. [2020-12-02 12:11:26,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:11:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1227 transitions. [2020-12-02 12:11:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 12:11:26,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:26,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:26,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 12:11:26,316 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash 598228971, now seen corresponding path program 2 times [2020-12-02 12:11:26,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:26,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117924088] [2020-12-02 12:11:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:26,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117924088] [2020-12-02 12:11:26,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:26,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:11:26,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003442797] [2020-12-02 12:11:26,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:11:26,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:11:26,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:11:26,424 INFO L87 Difference]: Start difference. First operand 427 states and 1227 transitions. Second operand 4 states. [2020-12-02 12:11:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:26,471 INFO L93 Difference]: Finished difference Result 406 states and 1020 transitions. [2020-12-02 12:11:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 12:11:26,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-02 12:11:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:26,476 INFO L225 Difference]: With dead ends: 406 [2020-12-02 12:11:26,476 INFO L226 Difference]: Without dead ends: 305 [2020-12-02 12:11:26,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:11:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-12-02 12:11:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-12-02 12:11:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-12-02 12:11:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 751 transitions. [2020-12-02 12:11:26,488 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 751 transitions. Word has length 11 [2020-12-02 12:11:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:26,488 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 751 transitions. [2020-12-02 12:11:26,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:11:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 751 transitions. [2020-12-02 12:11:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:11:26,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:26,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:26,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 12:11:26,491 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1735324875, now seen corresponding path program 1 times [2020-12-02 12:11:26,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:26,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11709541] [2020-12-02 12:11:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:26,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11709541] [2020-12-02 12:11:26,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:26,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:11:26,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67516254] [2020-12-02 12:11:26,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:11:26,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:11:26,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:11:26,651 INFO L87 Difference]: Start difference. First operand 305 states and 751 transitions. Second operand 5 states. [2020-12-02 12:11:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:26,706 INFO L93 Difference]: Finished difference Result 245 states and 547 transitions. [2020-12-02 12:11:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:11:26,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-02 12:11:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:26,709 INFO L225 Difference]: With dead ends: 245 [2020-12-02 12:11:26,709 INFO L226 Difference]: Without dead ends: 190 [2020-12-02 12:11:26,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:11:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-12-02 12:11:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2020-12-02 12:11:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-12-02 12:11:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 414 transitions. [2020-12-02 12:11:26,716 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 414 transitions. Word has length 13 [2020-12-02 12:11:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:26,717 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 414 transitions. [2020-12-02 12:11:26,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:11:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 414 transitions. [2020-12-02 12:11:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:11:26,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:26,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:26,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 12:11:26,719 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash 998638780, now seen corresponding path program 1 times [2020-12-02 12:11:26,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:26,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358291013] [2020-12-02 12:11:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:26,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358291013] [2020-12-02 12:11:26,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:26,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:11:26,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526624100] [2020-12-02 12:11:26,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:11:26,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:11:26,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:11:26,973 INFO L87 Difference]: Start difference. First operand 190 states and 414 transitions. Second operand 6 states. [2020-12-02 12:11:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:27,039 INFO L93 Difference]: Finished difference Result 169 states and 371 transitions. [2020-12-02 12:11:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:11:27,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 12:11:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:27,041 INFO L225 Difference]: With dead ends: 169 [2020-12-02 12:11:27,042 INFO L226 Difference]: Without dead ends: 138 [2020-12-02 12:11:27,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:11:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-12-02 12:11:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2020-12-02 12:11:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-12-02 12:11:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 288 transitions. [2020-12-02 12:11:27,047 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 288 transitions. Word has length 16 [2020-12-02 12:11:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:27,048 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 288 transitions. [2020-12-02 12:11:27,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:11:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 288 transitions. [2020-12-02 12:11:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:11:27,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:27,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:27,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 12:11:27,049 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:27,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:27,050 INFO L82 PathProgramCache]: Analyzing trace with hash 81413964, now seen corresponding path program 1 times [2020-12-02 12:11:27,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:27,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978322383] [2020-12-02 12:11:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:27,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978322383] [2020-12-02 12:11:27,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:27,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:11:27,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971083289] [2020-12-02 12:11:27,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:11:27,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:11:27,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:11:27,129 INFO L87 Difference]: Start difference. First operand 129 states and 288 transitions. Second operand 4 states. [2020-12-02 12:11:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:27,151 INFO L93 Difference]: Finished difference Result 270 states and 582 transitions. [2020-12-02 12:11:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:11:27,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-02 12:11:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:27,153 INFO L225 Difference]: With dead ends: 270 [2020-12-02 12:11:27,153 INFO L226 Difference]: Without dead ends: 93 [2020-12-02 12:11:27,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:11:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-02 12:11:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-12-02 12:11:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-12-02 12:11:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 192 transitions. [2020-12-02 12:11:27,157 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 192 transitions. Word has length 20 [2020-12-02 12:11:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:27,158 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 192 transitions. [2020-12-02 12:11:27,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:11:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 192 transitions. [2020-12-02 12:11:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:11:27,159 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:27,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:27,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 12:11:27,159 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -70851716, now seen corresponding path program 2 times [2020-12-02 12:11:27,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:27,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768293738] [2020-12-02 12:11:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:27,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768293738] [2020-12-02 12:11:27,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:27,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:11:27,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955143463] [2020-12-02 12:11:27,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:11:27,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:11:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:11:27,466 INFO L87 Difference]: Start difference. First operand 93 states and 192 transitions. Second operand 6 states. [2020-12-02 12:11:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:27,621 INFO L93 Difference]: Finished difference Result 113 states and 227 transitions. [2020-12-02 12:11:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:11:27,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-02 12:11:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:27,623 INFO L225 Difference]: With dead ends: 113 [2020-12-02 12:11:27,623 INFO L226 Difference]: Without dead ends: 93 [2020-12-02 12:11:27,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:11:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-02 12:11:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-12-02 12:11:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-12-02 12:11:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 190 transitions. [2020-12-02 12:11:27,631 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 190 transitions. Word has length 20 [2020-12-02 12:11:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:27,632 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 190 transitions. [2020-12-02 12:11:27,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:11:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 190 transitions. [2020-12-02 12:11:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:11:27,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:27,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:27,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 12:11:27,634 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1018559368, now seen corresponding path program 3 times [2020-12-02 12:11:27,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:27,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514550588] [2020-12-02 12:11:27,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:11:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:11:27,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514550588] [2020-12-02 12:11:27,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:11:27,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:11:27,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578459703] [2020-12-02 12:11:27,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:11:27,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:11:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:11:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:11:27,962 INFO L87 Difference]: Start difference. First operand 93 states and 190 transitions. Second operand 7 states. [2020-12-02 12:11:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:11:28,198 INFO L93 Difference]: Finished difference Result 107 states and 212 transitions. [2020-12-02 12:11:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:11:28,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-02 12:11:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:11:28,199 INFO L225 Difference]: With dead ends: 107 [2020-12-02 12:11:28,200 INFO L226 Difference]: Without dead ends: 59 [2020-12-02 12:11:28,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-02 12:11:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-02 12:11:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-12-02 12:11:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-02 12:11:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2020-12-02 12:11:28,204 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 20 [2020-12-02 12:11:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:11:28,204 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2020-12-02 12:11:28,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:11:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2020-12-02 12:11:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:11:28,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:11:28,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:11:28,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 12:11:28,206 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:11:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:11:28,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1788498744, now seen corresponding path program 4 times [2020-12-02 12:11:28,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:11:28,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872807674] [2020-12-02 12:11:28,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:11:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:11:28,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:11:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:11:28,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:11:28,391 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 12:11:28,391 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 12:11:28,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 12:11:28,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:11:28 BasicIcfg [2020-12-02 12:11:28,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 12:11:28,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 12:11:28,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 12:11:28,504 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 12:11:28,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:14" (3/4) ... [2020-12-02 12:11:28,507 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 12:11:28,664 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 12:11:28,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 12:11:28,666 INFO L168 Benchmark]: Toolchain (without parser) took 17195.03 ms. Allocated memory was 48.2 MB in the beginning and 323.0 MB in the end (delta: 274.7 MB). Free memory was 23.4 MB in the beginning and 227.6 MB in the end (delta: -204.2 MB). Peak memory consumption was 71.5 MB. Max. memory is 16.1 GB. [2020-12-02 12:11:28,667 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 48.2 MB. Free memory was 28.0 MB in the beginning and 28.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 12:11:28,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.38 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.3 MB in the beginning and 24.2 MB in the end (delta: -949.6 kB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:11:28,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.27 ms. Allocated memory is still 58.7 MB. Free memory was 24.0 MB in the beginning and 37.8 MB in the end (delta: -13.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:11:28,668 INFO L168 Benchmark]: Boogie Preprocessor took 89.24 ms. Allocated memory is still 58.7 MB. Free memory was 37.6 MB in the beginning and 35.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:11:28,669 INFO L168 Benchmark]: RCFGBuilder took 2243.97 ms. Allocated memory was 58.7 MB in the beginning and 88.1 MB in the end (delta: 29.4 MB). Free memory was 35.5 MB in the beginning and 37.9 MB in the end (delta: -2.4 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:11:28,669 INFO L168 Benchmark]: TraceAbstraction took 13777.94 ms. Allocated memory was 88.1 MB in the beginning and 323.0 MB in the end (delta: 234.9 MB). Free memory was 37.9 MB in the beginning and 243.3 MB in the end (delta: -205.4 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. [2020-12-02 12:11:28,670 INFO L168 Benchmark]: Witness Printer took 161.28 ms. Allocated memory is still 323.0 MB. Free memory was 243.3 MB in the beginning and 227.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-02 12:11:28,672 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.32 ms. Allocated memory is still 48.2 MB. Free memory was 28.0 MB in the beginning and 28.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 833.38 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.3 MB in the beginning and 24.2 MB in the end (delta: -949.6 kB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.27 ms. Allocated memory is still 58.7 MB. Free memory was 24.0 MB in the beginning and 37.8 MB in the end (delta: -13.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 89.24 ms. Allocated memory is still 58.7 MB. Free memory was 37.6 MB in the beginning and 35.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2243.97 ms. Allocated memory was 58.7 MB in the beginning and 88.1 MB in the end (delta: 29.4 MB). Free memory was 35.5 MB in the beginning and 37.9 MB in the end (delta: -2.4 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13777.94 ms. Allocated memory was 88.1 MB in the beginning and 323.0 MB in the end (delta: 234.9 MB). Free memory was 37.9 MB in the beginning and 243.3 MB in the end (delta: -205.4 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. * Witness Printer took 161.28 ms. Allocated memory is still 323.0 MB. Free memory was 243.3 MB in the beginning and 227.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1055 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 9 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 91 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 104 PlacesBefore, 35 PlacesAfterwards, 96 TransitionsBefore, 25 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 81 TotalNumberOfCompositions, 4221 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2396; [L829] FCALL, FORK 0 pthread_create(&t2396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L830] 0 pthread_t t2397; [L831] FCALL, FORK 0 pthread_create(&t2397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 pthread_t t2398; [L833] FCALL, FORK 0 pthread_create(&t2398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.2s, HoareTripleCheckerStatistics: 218 SDtfs, 305 SDslu, 380 SDs, 0 SdLazy, 168 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 17380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...