/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:59:32,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:59:32,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:59:32,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:59:32,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:59:32,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:59:32,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:59:32,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:59:32,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:59:32,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:59:32,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:59:32,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:59:32,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:59:32,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:59:32,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:59:32,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:59:32,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:59:32,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:59:32,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:59:32,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:59:32,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:59:32,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:59:32,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:59:32,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:59:32,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:59:32,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:59:32,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:59:32,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:59:32,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:59:32,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:59:32,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:59:32,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:59:32,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:59:32,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:59:32,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:59:32,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:59:32,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:59:32,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:59:32,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:59:32,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:59:32,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:59:32,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 14:59:32,630 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:59:32,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:59:32,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:59:32,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:59:32,634 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:59:32,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:59:32,635 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:59:32,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:59:32,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:59:32,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:59:32,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:59:32,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:59:32,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:59:32,638 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:59:32,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:59:32,638 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:59:32,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:59:32,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:59:32,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:59:32,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:59:32,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:59:32,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:59:32,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:59:32,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:59:32,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:59:32,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:59:32,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:59:32,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:59:32,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:59:32,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:59:32,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:59:33,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:59:33,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:59:33,007 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:59:33,008 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:59:33,009 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2020-10-11 14:59:33,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbab65db/e0e1f5497aa84627a8debce50575a605/FLAG42bc896b6 [2020-10-11 14:59:33,631 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:59:33,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2020-10-11 14:59:33,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbab65db/e0e1f5497aa84627a8debce50575a605/FLAG42bc896b6 [2020-10-11 14:59:33,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbab65db/e0e1f5497aa84627a8debce50575a605 [2020-10-11 14:59:33,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:59:33,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:59:33,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:59:33,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:59:33,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:59:33,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:59:33" (1/1) ... [2020-10-11 14:59:33,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147f5574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:33, skipping insertion in model container [2020-10-11 14:59:33,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:59:33" (1/1) ... [2020-10-11 14:59:33,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:59:33,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:59:34,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:59:34,494 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:59:34,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:59:34,631 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:59:34,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34 WrapperNode [2020-10-11 14:59:34,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:59:34,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:59:34,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:59:34,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:59:34,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:59:34,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:59:34,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:59:34,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:59:34,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (1/1) ... [2020-10-11 14:59:34,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:59:34,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:59:34,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:59:34,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:59:34,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (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-11 14:59:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:59:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:59:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:59:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:59:34,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:59:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:59:34,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:59:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:59:34,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:59:34,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:59:34,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:59:34,809 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 14:59:36,707 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:59:36,708 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:59:36,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:59:36 BoogieIcfgContainer [2020-10-11 14:59:36,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:59:36,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:59:36,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:59:36,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:59:36,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:59:33" (1/3) ... [2020-10-11 14:59:36,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25afa159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:59:36, skipping insertion in model container [2020-10-11 14:59:36,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:59:34" (2/3) ... [2020-10-11 14:59:36,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25afa159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:59:36, skipping insertion in model container [2020-10-11 14:59:36,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:59:36" (3/3) ... [2020-10-11 14:59:36,719 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc.i [2020-10-11 14:59:36,731 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:59:36,731 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:59:36,739 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:59:36,740 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:59:36,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,770 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,770 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,771 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,777 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,777 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,777 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,777 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,777 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,777 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,790 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,790 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,798 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:59:36,819 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 14:59:36,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:59:36,840 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:59:36,840 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:59:36,840 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:59:36,841 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:59:36,841 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:59:36,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:59:36,841 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:59:36,854 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:59:36,857 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 164 flow [2020-10-11 14:59:36,860 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 164 flow [2020-10-11 14:59:36,862 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 164 flow [2020-10-11 14:59:36,901 INFO L129 PetriNetUnfolder]: 2/75 cut-off events. [2020-10-11 14:59:36,902 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:59:36,906 INFO L80 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 75 events. 2/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-11 14:59:36,908 INFO L117 LiptonReduction]: Number of co-enabled transitions 960 [2020-10-11 14:59:37,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:37,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:59:37,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:59:37,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:37,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:37,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:37,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:37,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:37,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:37,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:37,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:37,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:37,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:59:37,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:37,118 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-11 14:59:37,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:37,123 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-11 14:59:37,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:37,877 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-11 14:59:38,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:38,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:38,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:38,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:38,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:38,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:38,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:59:38,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:38,022 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-11 14:59:38,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:38,025 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-11 14:59:38,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:38,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:38,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:59:38,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:59:38,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:38,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:38,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:38,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:38,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:38,807 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 14:59:38,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:59:38,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:39,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:39,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:39,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:39,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:39,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:39,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:39,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:39,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:39,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:39,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:59:39,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,882 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-11 14:59:39,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,884 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-11 14:59:39,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:39,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:59:39,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:59:39,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:39,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:39,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:59:40,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:59:40,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:40,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:40,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:40,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:59:40,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:40,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:59:40,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:59:40,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:59:40,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,042 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-11 14:59:40,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,044 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-11 14:59:40,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:40,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:40,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:40,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:40,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:40,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:40,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:40,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:40,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:40,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:59:40,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:59:40,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:40,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:59:40,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:59:40,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:59:40,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-11 14:59:40,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-11 14:59:40,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:59:40,805 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-10-11 14:59:40,914 INFO L132 LiptonReduction]: Checked pairs total: 2466 [2020-10-11 14:59:40,914 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-11 14:59:40,928 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow [2020-10-11 14:59:40,949 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2020-10-11 14:59:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2020-10-11 14:59:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 14:59:40,958 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:59:40,959 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 14:59:40,959 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:59:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:59:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 902458, now seen corresponding path program 1 times [2020-10-11 14:59:40,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:59:40,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424823905] [2020-10-11 14:59:40,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:59:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:59:41,241 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-11 14:59:41,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424823905] [2020-10-11 14:59:41,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:59:41,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:59:41,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990660110] [2020-10-11 14:59:41,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:59:41,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:59:41,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:59:41,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:59:41,267 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2020-10-11 14:59:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:59:41,351 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-10-11 14:59:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:59:41,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 14:59:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:59:41,372 INFO L225 Difference]: With dead ends: 162 [2020-10-11 14:59:41,372 INFO L226 Difference]: Without dead ends: 132 [2020-10-11 14:59:41,375 INFO L673 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-11 14:59:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-11 14:59:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-11 14:59:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-11 14:59:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2020-10-11 14:59:41,432 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 3 [2020-10-11 14:59:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:59:41,433 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2020-10-11 14:59:41,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:59:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2020-10-11 14:59:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-11 14:59:41,433 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:59:41,434 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:59:41,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:59:41,434 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:59:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:59:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash 270870414, now seen corresponding path program 1 times [2020-10-11 14:59:41,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:59:41,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394677417] [2020-10-11 14:59:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:59:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:59:41,495 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-11 14:59:41,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394677417] [2020-10-11 14:59:41,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:59:41,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:59:41,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32439254] [2020-10-11 14:59:41,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:59:41,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:59:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:59:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:59:41,499 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states. [2020-10-11 14:59:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:59:41,507 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2020-10-11 14:59:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:59:41,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-11 14:59:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:59:41,510 INFO L225 Difference]: With dead ends: 122 [2020-10-11 14:59:41,510 INFO L226 Difference]: Without dead ends: 122 [2020-10-11 14:59:41,511 INFO L673 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-11 14:59:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-11 14:59:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-11 14:59:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-11 14:59:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2020-10-11 14:59:41,523 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 7 [2020-10-11 14:59:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:59:41,524 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2020-10-11 14:59:41,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:59:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2020-10-11 14:59:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 14:59:41,525 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:59:41,525 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:59:41,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:59:41,525 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:59:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:59:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1718074267, now seen corresponding path program 1 times [2020-10-11 14:59:41,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:59:41,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779880119] [2020-10-11 14:59:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:59:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:59:41,617 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-11 14:59:41,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779880119] [2020-10-11 14:59:41,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:59:41,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:59:41,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942201463] [2020-10-11 14:59:41,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:59:41,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:59:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:59:41,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:59:41,620 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 4 states. [2020-10-11 14:59:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:59:41,655 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2020-10-11 14:59:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:59:41,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-11 14:59:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:59:41,657 INFO L225 Difference]: With dead ends: 100 [2020-10-11 14:59:41,657 INFO L226 Difference]: Without dead ends: 70 [2020-10-11 14:59:41,658 INFO L673 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-11 14:59:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-11 14:59:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-11 14:59:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-11 14:59:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2020-10-11 14:59:41,664 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 9 [2020-10-11 14:59:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:59:41,665 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2020-10-11 14:59:41,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:59:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2020-10-11 14:59:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 14:59:41,666 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:59:41,666 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:59:41,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:59:41,666 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:59:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:59:41,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1630846078, now seen corresponding path program 1 times [2020-10-11 14:59:41,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:59:41,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009603792] [2020-10-11 14:59:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:59:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:59:41,867 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-11 14:59:41,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009603792] [2020-10-11 14:59:41,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:59:41,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:59:41,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824155559] [2020-10-11 14:59:41,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:59:41,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:59:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:59:41,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:59:41,870 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 5 states. [2020-10-11 14:59:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:59:41,915 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2020-10-11 14:59:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:59:41,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-11 14:59:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:59:41,916 INFO L225 Difference]: With dead ends: 55 [2020-10-11 14:59:41,916 INFO L226 Difference]: Without dead ends: 45 [2020-10-11 14:59:41,917 INFO L673 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-11 14:59:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-11 14:59:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-11 14:59:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-11 14:59:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-10-11 14:59:41,923 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12 [2020-10-11 14:59:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:59:41,924 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-10-11 14:59:41,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:59:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-10-11 14:59:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 14:59:41,927 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:59:41,927 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:59:41,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:59:41,928 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:59:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:59:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1657869163, now seen corresponding path program 1 times [2020-10-11 14:59:41,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:59:41,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964700631] [2020-10-11 14:59:41,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:59:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:59:42,047 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-11 14:59:42,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964700631] [2020-10-11 14:59:42,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:59:42,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:59:42,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247763375] [2020-10-11 14:59:42,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:59:42,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:59:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:59:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:59:42,050 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 3 states. [2020-10-11 14:59:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:59:42,061 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2020-10-11 14:59:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:59:42,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-11 14:59:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:59:42,062 INFO L225 Difference]: With dead ends: 62 [2020-10-11 14:59:42,062 INFO L226 Difference]: Without dead ends: 35 [2020-10-11 14:59:42,063 INFO L673 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-11 14:59:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-11 14:59:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-11 14:59:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-11 14:59:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-11 14:59:42,067 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 16 [2020-10-11 14:59:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:59:42,067 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-11 14:59:42,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:59:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-11 14:59:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 14:59:42,068 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:59:42,068 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:59:42,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:59:42,069 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:59:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:59:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash -374696167, now seen corresponding path program 2 times [2020-10-11 14:59:42,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:59:42,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589306511] [2020-10-11 14:59:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:59:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:59:42,276 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-11 14:59:42,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589306511] [2020-10-11 14:59:42,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:59:42,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:59:42,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761860109] [2020-10-11 14:59:42,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:59:42,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:59:42,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:59:42,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:59:42,283 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 6 states. [2020-10-11 14:59:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:59:42,424 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2020-10-11 14:59:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:59:42,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-11 14:59:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:59:42,427 INFO L225 Difference]: With dead ends: 43 [2020-10-11 14:59:42,427 INFO L226 Difference]: Without dead ends: 25 [2020-10-11 14:59:42,427 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:59:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-11 14:59:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-11 14:59:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-11 14:59:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-11 14:59:42,430 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-11 14:59:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:59:42,430 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-11 14:59:42,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:59:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-11 14:59:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 14:59:42,432 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:59:42,432 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:59:42,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:59:42,433 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:59:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:59:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash 694115721, now seen corresponding path program 3 times [2020-10-11 14:59:42,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:59:42,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923076835] [2020-10-11 14:59:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:59:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:59:42,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:59:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:59:42,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:59:42,650 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 14:59:42,650 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 14:59:42,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:59:42,652 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 14:59:42,662 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L806-->L813: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In291855290 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In291855290 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In291855290 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In291855290 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~x$r_buff0_thd0~0_Out291855290 ~x$r_buff0_thd0~0_In291855290) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In291855290| ULTIMATE.start_assume_abort_if_not_~cond_Out291855290) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out291855290 0)) (or (and .cse0 (= ~x$w_buff1_used~0_Out291855290 0) .cse1) (and .cse2 (= ~x$w_buff1_used~0_In291855290 ~x$w_buff1_used~0_Out291855290))) (or (and (= ~x$w_buff0_used~0_In291855290 ~x$w_buff0_used~0_Out291855290) .cse3) (and .cse4 (= ~x$w_buff0_used~0_Out291855290 0) .cse5)) (or (and (or (and .cse2 (= ~x~0_In291855290 ~x~0_Out291855290)) (and .cse0 (= ~x$w_buff1~0_In291855290 ~x~0_Out291855290) .cse1)) .cse3) (and (= ~x$w_buff0~0_In291855290 ~x~0_Out291855290) .cse4 .cse5)) (= ~x$r_buff1_thd0~0_Out291855290 ~x$r_buff1_thd0~0_In291855290)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In291855290, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In291855290, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In291855290|, ~x$w_buff1~0=~x$w_buff1~0_In291855290, ~x$w_buff1_used~0=~x$w_buff1_used~0_In291855290, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In291855290, ~x~0=~x~0_In291855290, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291855290} OutVars{~x$w_buff0~0=~x$w_buff0~0_In291855290, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out291855290, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out291855290|, ~x$w_buff1~0=~x$w_buff1~0_In291855290, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out291855290, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out291855290, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out291855290|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out291855290|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out291855290|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out291855290, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In291855290|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out291855290|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out291855290|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out291855290, ~x~0=~x~0_Out291855290} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite39, ~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~ite44, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-11 14:59:42,666 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-11 14:59:42,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,669 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-11 14:59:42,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,669 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-11 14:59:42,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,669 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-11 14:59:42,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,670 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-11 14:59:42,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,670 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-11 14:59:42,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,671 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-11 14:59:42,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,671 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-11 14:59:42,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,672 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-11 14:59:42,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,672 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-11 14:59:42,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,672 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-11 14:59:42,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,673 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-11 14:59:42,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,673 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-11 14:59:42,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,674 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-11 14:59:42,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,674 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-11 14:59:42,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,674 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-11 14:59:42,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,675 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-11 14:59:42,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,675 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-11 14:59:42,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,676 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-11 14:59:42,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,676 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-11 14:59:42,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,676 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-11 14:59:42,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,677 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-11 14:59:42,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:59:42,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:59:42 BasicIcfg [2020-10-11 14:59:42,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:59:42,726 INFO L168 Benchmark]: Toolchain (without parser) took 8836.31 ms. Allocated memory was 248.0 MB in the beginning and 507.0 MB in the end (delta: 259.0 MB). Free memory was 203.3 MB in the beginning and 367.3 MB in the end (delta: -164.0 MB). Peak memory consumption was 95.0 MB. Max. memory is 14.2 GB. [2020-10-11 14:59:42,727 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 248.0 MB. Free memory was 226.0 MB in the beginning and 225.2 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-11 14:59:42,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.82 ms. Allocated memory was 248.0 MB in the beginning and 303.6 MB in the end (delta: 55.6 MB). Free memory was 203.3 MB in the beginning and 255.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:59:42,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.19 ms. Allocated memory is still 303.6 MB. Free memory was 255.2 MB in the beginning and 252.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. [2020-10-11 14:59:42,730 INFO L168 Benchmark]: Boogie Preprocessor took 36.79 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:59:42,731 INFO L168 Benchmark]: RCFGBuilder took 1981.25 ms. Allocated memory was 303.6 MB in the beginning and 353.4 MB in the end (delta: 49.8 MB). Free memory was 250.1 MB in the beginning and 212.1 MB in the end (delta: 38.0 MB). Peak memory consumption was 100.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:59:42,732 INFO L168 Benchmark]: TraceAbstraction took 6012.79 ms. Allocated memory was 353.4 MB in the beginning and 507.0 MB in the end (delta: 153.6 MB). Free memory was 212.1 MB in the beginning and 367.3 MB in the end (delta: -155.2 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:59:42,737 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.25 ms. Allocated memory is still 248.0 MB. Free memory was 226.0 MB in the beginning and 225.2 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 740.82 ms. Allocated memory was 248.0 MB in the beginning and 303.6 MB in the end (delta: 55.6 MB). Free memory was 203.3 MB in the beginning and 255.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 59.19 ms. Allocated memory is still 303.6 MB. Free memory was 255.2 MB in the beginning and 252.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.79 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1981.25 ms. Allocated memory was 303.6 MB in the beginning and 353.4 MB in the end (delta: 49.8 MB). Free memory was 250.1 MB in the beginning and 212.1 MB in the end (delta: 38.0 MB). Peak memory consumption was 100.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6012.79 ms. Allocated memory was 353.4 MB in the beginning and 507.0 MB in the end (delta: 153.6 MB). Free memory was 212.1 MB in the beginning and 367.3 MB in the end (delta: -155.2 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 616 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 62 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.0s, 82 PlacesBefore, 27 PlacesAfterwards, 77 TransitionsBefore, 20 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2466 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L706] 0 _Bool x$flush_delayed; [L707] 0 int x$mem_tmp; [L708] 0 _Bool x$r_buff0_thd0; [L709] 0 _Bool x$r_buff0_thd1; [L710] 0 _Bool x$r_buff0_thd2; [L711] 0 _Bool x$r_buff1_thd0; [L712] 0 _Bool x$r_buff1_thd1; [L713] 0 _Bool x$r_buff1_thd2; [L714] 0 _Bool x$read_delayed; [L715] 0 int *x$read_delayed_var; [L716] 0 int x$w_buff0; [L717] 0 _Bool x$w_buff0_used; [L718] 0 int x$w_buff1; [L719] 0 _Bool x$w_buff1_used; [L721] 0 int y = 0; [L722] 0 _Bool weak$$choice0; [L723] 0 _Bool weak$$choice2; [L799] 0 pthread_t t1713; [L800] FCALL, FORK 0 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 x$w_buff1 = x$w_buff0 [L728] 1 x$w_buff0 = 1 [L729] 1 x$w_buff1_used = x$w_buff0_used [L730] 1 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L732] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L733] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L734] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L735] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1714; [L802] FCALL, FORK 0 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L755] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 x$flush_delayed = weak$$choice2 [L764] 2 x$mem_tmp = x [L765] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L765] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L766] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L766] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L766] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L766] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L767] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L767] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L768] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L768] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L768] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L770] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L771] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = x [L773] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L773] 2 x = x$flush_delayed ? x$mem_tmp : x [L774] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L777] 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) [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 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 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 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 [L748] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L750] 1 return 0; [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 110 SDtfs, 96 SDslu, 128 SDs, 0 SdLazy, 73 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 3578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...