/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:08:48,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:08:48,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:08:48,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:08:48,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:08:48,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:08:48,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:08:48,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:08:48,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:08:48,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:08:48,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:08:48,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:08:48,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:08:48,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:08:48,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:08:48,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:08:48,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:08:48,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:08:48,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:08:48,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:08:48,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:08:48,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:08:48,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:08:48,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:08:48,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:08:48,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:08:48,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:08:48,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:08:48,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:08:48,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:08:48,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:08:48,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:08:48,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:08:48,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:08:48,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:08:48,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:08:48,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:08:48,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:08:48,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:08:48,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:08:48,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:08:48,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 22:08:48,608 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:08:48,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:08:48,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:08:48,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:08:48,610 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:08:48,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:08:48,611 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:08:48,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:08:48,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:08:48,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:08:48,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:08:48,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:08:48,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:08:48,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:08:48,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:08:48,612 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:08:48,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:08:48,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:08:48,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:08:48,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:08:48,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:08:48,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:08:48,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:08:48,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:08:48,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:08:48,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:08:48,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:08:48,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:08:48,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:08:48,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:08:48,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:08:48,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:08:48,968 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:08:48,971 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:08:48,972 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i [2020-10-15 22:08:49,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47747ac85/df19995430454ceca388326b570233ba/FLAGa2dc932e2 [2020-10-15 22:08:49,529 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:08:49,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i [2020-10-15 22:08:49,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47747ac85/df19995430454ceca388326b570233ba/FLAGa2dc932e2 [2020-10-15 22:08:49,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47747ac85/df19995430454ceca388326b570233ba [2020-10-15 22:08:49,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:08:49,832 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:08:49,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:08:49,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:08:49,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:08:49,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:08:49" (1/1) ... [2020-10-15 22:08:49,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b495ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:49, skipping insertion in model container [2020-10-15 22:08:49,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:08:49" (1/1) ... [2020-10-15 22:08:49,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:08:49,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:08:50,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:08:50,423 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:08:50,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:08:50,558 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:08:50,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50 WrapperNode [2020-10-15 22:08:50,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:08:50,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:08:50,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:08:50,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:08:50,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:08:50,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:08:50,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:08:50,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:08:50,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (1/1) ... [2020-10-15 22:08:50,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:08:50,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:08:50,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:08:50,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:08:50,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (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-10-15 22:08:50,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:08:50,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:08:50,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:08:50,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:08:50,728 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:08:50,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:08:50,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:08:50,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:08:50,734 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 22:08:50,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 22:08:50,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:08:50,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:08:50,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:08:50,737 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:08:52,733 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:08:52,734 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:08:52,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:08:52 BoogieIcfgContainer [2020-10-15 22:08:52,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:08:52,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:08:52,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:08:52,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:08:52,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:08:49" (1/3) ... [2020-10-15 22:08:52,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1523346a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:08:52, skipping insertion in model container [2020-10-15 22:08:52,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:08:50" (2/3) ... [2020-10-15 22:08:52,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1523346a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:08:52, skipping insertion in model container [2020-10-15 22:08:52,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:08:52" (3/3) ... [2020-10-15 22:08:52,745 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_pso.oepc.i [2020-10-15 22:08:52,757 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:08:52,757 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:08:52,765 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:08:52,766 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:08:52,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,819 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,824 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,824 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:08:52,847 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 22:08:52,869 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:08:52,869 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:08:52,869 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:08:52,869 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:08:52,869 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:08:52,870 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:08:52,870 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:08:52,870 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:08:52,884 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:08:52,887 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-15 22:08:52,889 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-15 22:08:52,891 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-15 22:08:52,937 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-15 22:08:52,938 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:08:52,943 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-15 22:08:52,946 INFO L117 LiptonReduction]: Number of co-enabled transitions 1544 [2020-10-15 22:08:53,439 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 22:08:53,573 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 22:08:53,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:53,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:53,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:53,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:53,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:53,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:53,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:53,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:53,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:53,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:53,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:53,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:53,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:53,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:53,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:53,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:53,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:08:53,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:53,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:08:53,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:53,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:08:53,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:54,146 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-15 22:08:54,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:54,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:54,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:54,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:54,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:54,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:54,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:54,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:54,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:54,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:54,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:54,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:54,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:54,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:54,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:54,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:54,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:08:54,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:54,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:54,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:54,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:08:54,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:08:54,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:54,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:54,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:54,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:54,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:54,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:54,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:08:54,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:54,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:54,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:54,831 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 22:08:54,964 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 22:08:54,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:54,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:08:55,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:08:55,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:08:55,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:08:55,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:08:55,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:08:55,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:55,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:08:55,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:08:55,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:08:55,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:55,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:55,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:55,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:08:55,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:08:55,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:55,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 22:08:55,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:08:55,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:56,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:56,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:56,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:56,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:56,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:56,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:08:56,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:56,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:56,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:56,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:08:56,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:56,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:56,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:56,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:08:56,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:08:56,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:56,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:56,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:08:56,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:08:56,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 22:08:56,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:08:56,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:08:56,968 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-15 22:08:57,099 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-15 22:08:57,125 INFO L132 LiptonReduction]: Checked pairs total: 4006 [2020-10-15 22:08:57,125 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-15 22:08:57,132 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-15 22:08:57,172 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states. [2020-10-15 22:08:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states. [2020-10-15 22:08:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 22:08:57,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:57,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 22:08:57,183 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:57,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 914642709, now seen corresponding path program 1 times [2020-10-15 22:08:57,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:57,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063691217] [2020-10-15 22:08:57,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:57,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063691217] [2020-10-15 22:08:57,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:57,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:08:57,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336098724] [2020-10-15 22:08:57,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:08:57,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:57,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:08:57,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:08:57,466 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states. [2020-10-15 22:08:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:57,542 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-15 22:08:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:08:57,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 22:08:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:57,565 INFO L225 Difference]: With dead ends: 550 [2020-10-15 22:08:57,565 INFO L226 Difference]: Without dead ends: 450 [2020-10-15 22:08:57,567 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-10-15 22:08:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-15 22:08:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-15 22:08:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-15 22:08:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-15 22:08:57,650 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5 [2020-10-15 22:08:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:57,651 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-15 22:08:57,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:08:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-15 22:08:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 22:08:57,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:57,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:57,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:08:57,653 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash 577618716, now seen corresponding path program 1 times [2020-10-15 22:08:57,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:57,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979092003] [2020-10-15 22:08:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:57,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979092003] [2020-10-15 22:08:57,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:57,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:08:57,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731524875] [2020-10-15 22:08:57,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:08:57,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:08:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:08:57,766 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-15 22:08:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:57,785 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-15 22:08:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:08:57,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 22:08:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:57,790 INFO L225 Difference]: With dead ends: 440 [2020-10-15 22:08:57,791 INFO L226 Difference]: Without dead ends: 440 [2020-10-15 22:08:57,791 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-10-15 22:08:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-15 22:08:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-15 22:08:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-15 22:08:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-15 22:08:57,816 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-15 22:08:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:57,817 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-15 22:08:57,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:08:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-15 22:08:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 22:08:57,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:57,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:57,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:08:57,819 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash 644629497, now seen corresponding path program 1 times [2020-10-15 22:08:57,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:57,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941383633] [2020-10-15 22:08:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:57,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941383633] [2020-10-15 22:08:57,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:57,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:08:57,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301301113] [2020-10-15 22:08:57,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:08:57,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:08:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:08:57,879 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-15 22:08:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:57,889 INFO L93 Difference]: Finished difference Result 422 states and 1257 transitions. [2020-10-15 22:08:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:08:57,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-15 22:08:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:57,893 INFO L225 Difference]: With dead ends: 422 [2020-10-15 22:08:57,893 INFO L226 Difference]: Without dead ends: 422 [2020-10-15 22:08:57,894 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-10-15 22:08:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-15 22:08:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2020-10-15 22:08:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-15 22:08:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1257 transitions. [2020-10-15 22:08:57,910 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1257 transitions. Word has length 10 [2020-10-15 22:08:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:57,911 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1257 transitions. [2020-10-15 22:08:57,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:08:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1257 transitions. [2020-10-15 22:08:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:08:57,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:57,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:57,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:08:57,914 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1491369423, now seen corresponding path program 1 times [2020-10-15 22:08:57,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:57,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510622703] [2020-10-15 22:08:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510622703] [2020-10-15 22:08:58,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:08:58,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742760911] [2020-10-15 22:08:58,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:08:58,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:08:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:08:58,008 INFO L87 Difference]: Start difference. First operand 422 states and 1257 transitions. Second operand 4 states. [2020-10-15 22:08:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,058 INFO L93 Difference]: Finished difference Result 899 states and 2604 transitions. [2020-10-15 22:08:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:08:58,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 22:08:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,063 INFO L225 Difference]: With dead ends: 899 [2020-10-15 22:08:58,063 INFO L226 Difference]: Without dead ends: 566 [2020-10-15 22:08:58,064 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-10-15 22:08:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-10-15 22:08:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 422. [2020-10-15 22:08:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-15 22:08:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1224 transitions. [2020-10-15 22:08:58,079 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1224 transitions. Word has length 11 [2020-10-15 22:08:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,079 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1224 transitions. [2020-10-15 22:08:58,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:08:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1224 transitions. [2020-10-15 22:08:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:08:58,082 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:58,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:08:58,082 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1039296419, now seen corresponding path program 2 times [2020-10-15 22:08:58,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752530199] [2020-10-15 22:08:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752530199] [2020-10-15 22:08:58,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:08:58,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694946201] [2020-10-15 22:08:58,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:08:58,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:08:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:08:58,135 INFO L87 Difference]: Start difference. First operand 422 states and 1224 transitions. Second operand 4 states. [2020-10-15 22:08:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,161 INFO L93 Difference]: Finished difference Result 542 states and 1550 transitions. [2020-10-15 22:08:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:08:58,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 22:08:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,164 INFO L225 Difference]: With dead ends: 542 [2020-10-15 22:08:58,164 INFO L226 Difference]: Without dead ends: 302 [2020-10-15 22:08:58,164 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-10-15 22:08:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-15 22:08:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2020-10-15 22:08:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-15 22:08:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 832 transitions. [2020-10-15 22:08:58,174 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 832 transitions. Word has length 11 [2020-10-15 22:08:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,175 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 832 transitions. [2020-10-15 22:08:58,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:08:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 832 transitions. [2020-10-15 22:08:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:08:58,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:58,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:08:58,176 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1776505378, now seen corresponding path program 1 times [2020-10-15 22:08:58,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179317267] [2020-10-15 22:08:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179317267] [2020-10-15 22:08:58,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:08:58,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979111727] [2020-10-15 22:08:58,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:08:58,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:08:58,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:08:58,215 INFO L87 Difference]: Start difference. First operand 302 states and 832 transitions. Second operand 3 states. [2020-10-15 22:08:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,229 INFO L93 Difference]: Finished difference Result 398 states and 1088 transitions. [2020-10-15 22:08:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:08:58,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 22:08:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,231 INFO L225 Difference]: With dead ends: 398 [2020-10-15 22:08:58,232 INFO L226 Difference]: Without dead ends: 209 [2020-10-15 22:08:58,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-15 22:08:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-15 22:08:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-15 22:08:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-15 22:08:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 572 transitions. [2020-10-15 22:08:58,239 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 572 transitions. Word has length 12 [2020-10-15 22:08:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,240 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 572 transitions. [2020-10-15 22:08:58,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:08:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 572 transitions. [2020-10-15 22:08:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:08:58,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:58,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:08:58,241 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash 762867507, now seen corresponding path program 1 times [2020-10-15 22:08:58,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936426473] [2020-10-15 22:08:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936426473] [2020-10-15 22:08:58,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:08:58,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091663895] [2020-10-15 22:08:58,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:08:58,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:08:58,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:08:58,299 INFO L87 Difference]: Start difference. First operand 209 states and 572 transitions. Second operand 3 states. [2020-10-15 22:08:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,304 INFO L93 Difference]: Finished difference Result 200 states and 542 transitions. [2020-10-15 22:08:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:08:58,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 22:08:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,307 INFO L225 Difference]: With dead ends: 200 [2020-10-15 22:08:58,307 INFO L226 Difference]: Without dead ends: 200 [2020-10-15 22:08:58,307 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-10-15 22:08:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-10-15 22:08:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2020-10-15 22:08:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-15 22:08:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 542 transitions. [2020-10-15 22:08:58,314 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 542 transitions. Word has length 13 [2020-10-15 22:08:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,314 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 542 transitions. [2020-10-15 22:08:58,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:08:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 542 transitions. [2020-10-15 22:08:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:08:58,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:58,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:08:58,316 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2120975707, now seen corresponding path program 1 times [2020-10-15 22:08:58,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671593327] [2020-10-15 22:08:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671593327] [2020-10-15 22:08:58,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:08:58,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860569400] [2020-10-15 22:08:58,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:08:58,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:08:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:08:58,355 INFO L87 Difference]: Start difference. First operand 200 states and 542 transitions. Second operand 4 states. [2020-10-15 22:08:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,374 INFO L93 Difference]: Finished difference Result 281 states and 758 transitions. [2020-10-15 22:08:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:08:58,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 22:08:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,376 INFO L225 Difference]: With dead ends: 281 [2020-10-15 22:08:58,376 INFO L226 Difference]: Without dead ends: 173 [2020-10-15 22:08:58,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-15 22:08:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-15 22:08:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-15 22:08:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-15 22:08:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 452 transitions. [2020-10-15 22:08:58,382 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 452 transitions. Word has length 14 [2020-10-15 22:08:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,382 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 452 transitions. [2020-10-15 22:08:58,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:08:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 452 transitions. [2020-10-15 22:08:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:08:58,383 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:58,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:08:58,384 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2121696457, now seen corresponding path program 2 times [2020-10-15 22:08:58,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667778824] [2020-10-15 22:08:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667778824] [2020-10-15 22:08:58,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:08:58,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860061140] [2020-10-15 22:08:58,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:08:58,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:08:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:08:58,452 INFO L87 Difference]: Start difference. First operand 173 states and 452 transitions. Second operand 4 states. [2020-10-15 22:08:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,485 INFO L93 Difference]: Finished difference Result 173 states and 397 transitions. [2020-10-15 22:08:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:08:58,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 22:08:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,487 INFO L225 Difference]: With dead ends: 173 [2020-10-15 22:08:58,487 INFO L226 Difference]: Without dead ends: 129 [2020-10-15 22:08:58,487 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-10-15 22:08:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-15 22:08:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-10-15 22:08:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-15 22:08:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 292 transitions. [2020-10-15 22:08:58,491 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 292 transitions. Word has length 14 [2020-10-15 22:08:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,492 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 292 transitions. [2020-10-15 22:08:58,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:08:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 292 transitions. [2020-10-15 22:08:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:08:58,493 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:58,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:08:58,493 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1022421451, now seen corresponding path program 1 times [2020-10-15 22:08:58,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181193925] [2020-10-15 22:08:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181193925] [2020-10-15 22:08:58,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:08:58,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308482126] [2020-10-15 22:08:58,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:08:58,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:08:58,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:08:58,561 INFO L87 Difference]: Start difference. First operand 129 states and 292 transitions. Second operand 5 states. [2020-10-15 22:08:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,604 INFO L93 Difference]: Finished difference Result 107 states and 211 transitions. [2020-10-15 22:08:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:08:58,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-15 22:08:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,605 INFO L225 Difference]: With dead ends: 107 [2020-10-15 22:08:58,605 INFO L226 Difference]: Without dead ends: 81 [2020-10-15 22:08:58,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:08:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-15 22:08:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-10-15 22:08:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-15 22:08:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 152 transitions. [2020-10-15 22:08:58,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 152 transitions. Word has length 16 [2020-10-15 22:08:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,609 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 152 transitions. [2020-10-15 22:08:58,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:08:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 152 transitions. [2020-10-15 22:08:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:08:58,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:08:58,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:08:58,611 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2141011581, now seen corresponding path program 1 times [2020-10-15 22:08:58,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462940228] [2020-10-15 22:08:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:58,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462940228] [2020-10-15 22:08:58,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:58,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:08:58,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338613316] [2020-10-15 22:08:58,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:08:58,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:08:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:08:58,690 INFO L87 Difference]: Start difference. First operand 81 states and 152 transitions. Second operand 6 states. [2020-10-15 22:08:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:58,742 INFO L93 Difference]: Finished difference Result 69 states and 126 transitions. [2020-10-15 22:08:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:08:58,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-15 22:08:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:58,744 INFO L225 Difference]: With dead ends: 69 [2020-10-15 22:08:58,744 INFO L226 Difference]: Without dead ends: 61 [2020-10-15 22:08:58,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:08:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-15 22:08:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-15 22:08:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-15 22:08:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2020-10-15 22:08:58,747 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 18 [2020-10-15 22:08:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:58,747 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions. [2020-10-15 22:08:58,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:08:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2020-10-15 22:08:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 22:08:58,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:58,748 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-10-15 22:08:58,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:08:58,749 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash -280198634, now seen corresponding path program 1 times [2020-10-15 22:08:58,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:58,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669763631] [2020-10-15 22:08:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:59,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669763631] [2020-10-15 22:08:59,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:59,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:08:59,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147344167] [2020-10-15 22:08:59,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:08:59,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:59,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:08:59,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:08:59,056 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 7 states. [2020-10-15 22:08:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:59,161 INFO L93 Difference]: Finished difference Result 83 states and 150 transitions. [2020-10-15 22:08:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:08:59,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-15 22:08:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:59,162 INFO L225 Difference]: With dead ends: 83 [2020-10-15 22:08:59,163 INFO L226 Difference]: Without dead ends: 49 [2020-10-15 22:08:59,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:08:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-15 22:08:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-15 22:08:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-15 22:08:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 84 transitions. [2020-10-15 22:08:59,165 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 84 transitions. Word has length 20 [2020-10-15 22:08:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:59,166 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 84 transitions. [2020-10-15 22:08:59,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:08:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 84 transitions. [2020-10-15 22:08:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 22:08:59,167 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:59,167 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-10-15 22:08:59,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:08:59,167 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1217087894, now seen corresponding path program 2 times [2020-10-15 22:08:59,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:59,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464762250] [2020-10-15 22:08:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:08:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:08:59,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464762250] [2020-10-15 22:08:59,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:08:59,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 22:08:59,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129564990] [2020-10-15 22:08:59,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 22:08:59,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:08:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 22:08:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:08:59,493 INFO L87 Difference]: Start difference. First operand 49 states and 84 transitions. Second operand 11 states. [2020-10-15 22:08:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:08:59,952 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2020-10-15 22:08:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 22:08:59,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-15 22:08:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:08:59,953 INFO L225 Difference]: With dead ends: 69 [2020-10-15 22:08:59,953 INFO L226 Difference]: Without dead ends: 47 [2020-10-15 22:08:59,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-15 22:08:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-15 22:08:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-10-15 22:08:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-15 22:08:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-10-15 22:08:59,956 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 20 [2020-10-15 22:08:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:08:59,956 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-10-15 22:08:59,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 22:08:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-10-15 22:08:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 22:08:59,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:08:59,957 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-10-15 22:08:59,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:08:59,957 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:08:59,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:08:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1607503078, now seen corresponding path program 3 times [2020-10-15 22:08:59,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:08:59,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534384532] [2020-10-15 22:08:59,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:08:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:09:00,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534384532] [2020-10-15 22:09:00,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:00,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 22:09:00,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072188128] [2020-10-15 22:09:00,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 22:09:00,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 22:09:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:09:00,274 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 11 states. [2020-10-15 22:09:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:00,651 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2020-10-15 22:09:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:09:00,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-15 22:09:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:00,652 INFO L225 Difference]: With dead ends: 64 [2020-10-15 22:09:00,653 INFO L226 Difference]: Without dead ends: 50 [2020-10-15 22:09:00,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-10-15 22:09:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-15 22:09:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2020-10-15 22:09:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-15 22:09:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-15 22:09:00,656 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20 [2020-10-15 22:09:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:00,656 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-15 22:09:00,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 22:09:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-15 22:09:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 22:09:00,657 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:00,657 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-10-15 22:09:00,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 22:09:00,658 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1827958826, now seen corresponding path program 4 times [2020-10-15 22:09:00,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:00,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438122738] [2020-10-15 22:09:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:09:00,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:09:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:09:00,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:09:00,762 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:09:00,762 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:09:00,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 22:09:00,764 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 22:09:00,777 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L3-->L836: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-350036971 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-350036971 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-350036971 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-350036971 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 (= ~x$w_buff1_used~0_In-350036971 ~x$w_buff1_used~0_Out-350036971)) (and .cse1 (= ~x$w_buff1_used~0_Out-350036971 0) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-350036971 0)) (or (and .cse3 (= ~x$w_buff0~0_In-350036971 ~x~0_Out-350036971) .cse4) (and .cse5 (or (and .cse0 (= ~x~0_In-350036971 ~x~0_Out-350036971)) (and (= ~x$w_buff1~0_In-350036971 ~x~0_Out-350036971) .cse1 .cse2)))) (= ~x$r_buff1_thd0~0_Out-350036971 ~x$r_buff1_thd0~0_In-350036971) (or (and .cse3 .cse4 (= ~x$w_buff0_used~0_Out-350036971 0)) (and .cse5 (= ~x$w_buff0_used~0_In-350036971 ~x$w_buff0_used~0_Out-350036971))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-350036971 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-350036971|) (= ~x$r_buff0_thd0~0_Out-350036971 ~x$r_buff0_thd0~0_In-350036971)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-350036971, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-350036971, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-350036971|, ~x$w_buff1~0=~x$w_buff1~0_In-350036971, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-350036971, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-350036971, ~x~0=~x~0_In-350036971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-350036971} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-350036971, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-350036971, ~x$w_buff1~0=~x$w_buff1~0_In-350036971, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-350036971, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-350036971, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-350036971|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-350036971|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-350036971|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-350036971, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-350036971|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-350036971|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-350036971|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-350036971|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-350036971, ~x~0=~x~0_Out-350036971} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2020-10-15 22:09:00,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:09:00,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:00,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:09:00 BasicIcfg [2020-10-15 22:09:00,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:09:00,850 INFO L168 Benchmark]: Toolchain (without parser) took 11019.17 ms. Allocated memory was 252.2 MB in the beginning and 503.8 MB in the end (delta: 251.7 MB). Free memory was 207.9 MB in the beginning and 293.0 MB in the end (delta: -85.1 MB). Peak memory consumption was 166.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:00,851 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 252.2 MB. Free memory was 230.2 MB in the beginning and 229.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-15 22:09:00,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.04 ms. Allocated memory was 252.2 MB in the beginning and 316.1 MB in the end (delta: 64.0 MB). Free memory was 207.9 MB in the beginning and 268.0 MB in the end (delta: -60.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:00,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.06 ms. Allocated memory is still 316.1 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:00,853 INFO L168 Benchmark]: Boogie Preprocessor took 37.75 ms. Allocated memory is still 316.1 MB. Free memory was 265.5 MB in the beginning and 262.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:00,854 INFO L168 Benchmark]: RCFGBuilder took 2079.15 ms. Allocated memory was 316.1 MB in the beginning and 359.1 MB in the end (delta: 43.0 MB). Free memory was 262.9 MB in the beginning and 212.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 100.8 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:00,855 INFO L168 Benchmark]: TraceAbstraction took 8108.90 ms. Allocated memory was 359.1 MB in the beginning and 503.8 MB in the end (delta: 144.7 MB). Free memory was 212.9 MB in the beginning and 293.0 MB in the end (delta: -80.1 MB). Peak memory consumption was 64.6 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:00,858 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 252.2 MB. Free memory was 230.2 MB in the beginning and 229.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 726.04 ms. Allocated memory was 252.2 MB in the beginning and 316.1 MB in the end (delta: 64.0 MB). Free memory was 207.9 MB in the beginning and 268.0 MB in the end (delta: -60.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 59.06 ms. Allocated memory is still 316.1 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.75 ms. Allocated memory is still 316.1 MB. Free memory was 265.5 MB in the beginning and 262.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2079.15 ms. Allocated memory was 316.1 MB in the beginning and 359.1 MB in the end (delta: 43.0 MB). Free memory was 262.9 MB in the beginning and 212.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 100.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8108.90 ms. Allocated memory was 359.1 MB in the beginning and 503.8 MB in the end (delta: 144.7 MB). Free memory was 212.9 MB in the beginning and 293.0 MB in the end (delta: -80.1 MB). Peak memory consumption was 64.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1055 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 9 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 118 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.2s, 100 PlacesBefore, 35 PlacesAfterwards, 92 TransitionsBefore, 25 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4006 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L710] 0 _Bool x$flush_delayed; [L711] 0 int x$mem_tmp; [L712] 0 _Bool x$r_buff0_thd0; [L713] 0 _Bool x$r_buff0_thd1; [L714] 0 _Bool x$r_buff0_thd2; [L715] 0 _Bool x$r_buff0_thd3; [L716] 0 _Bool x$r_buff1_thd0; [L717] 0 _Bool x$r_buff1_thd1; [L718] 0 _Bool x$r_buff1_thd2; [L719] 0 _Bool x$r_buff1_thd3; [L720] 0 _Bool x$read_delayed; [L721] 0 int *x$read_delayed_var; [L722] 0 int x$w_buff0; [L723] 0 _Bool x$w_buff0_used; [L724] 0 int x$w_buff1; [L725] 0 _Bool x$w_buff1_used; [L727] 0 int y = 0; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1903; [L821] FCALL, FORK 0 pthread_create(&t1903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1904; [L823] FCALL, FORK 0 pthread_create(&t1904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 1 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L824] 0 pthread_t t1905; [L825] FCALL, FORK 0 pthread_create(&t1905, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L738] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L739] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L740] 1 x$flush_delayed = weak$$choice2 [L741] 1 x$mem_tmp = x [L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L743] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L745] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L747] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L748] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L748] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] 1 __unbuffered_p0_EAX = x [L750] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L750] 1 x = x$flush_delayed ? x$mem_tmp : x [L751] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 317 SDtfs, 247 SDslu, 585 SDs, 0 SdLazy, 673 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred 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, 14 MinimizatonAttempts, 155 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 20011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...