/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:11:20,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:11:20,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:11:20,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:11:20,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:11:20,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:11:20,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:11:20,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:11:20,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:11:20,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:11:20,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:11:20,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:11:20,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:11:20,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:11:20,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:11:20,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:11:20,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:11:20,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:11:20,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:11:20,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:11:20,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:11:20,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:11:20,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:11:20,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:11:20,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:11:20,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:11:20,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:11:20,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:11:20,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:11:20,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:11:20,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:11:20,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:11:20,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:11:20,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:11:20,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:11:20,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:11:20,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:11:20,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:11:20,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:11:20,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:11:20,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:11:20,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 01:11:20,794 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:11:20,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:11:20,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:11:20,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:11:20,796 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:11:20,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:11:20,796 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:11:20,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:11:20,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:11:20,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:11:20,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:11:20,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:11:20,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:11:20,797 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:11:20,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:11:20,798 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:11:20,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:11:20,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:11:20,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:11:20,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:11:20,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:11:20,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:11:20,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:11:20,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:11:20,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:11:20,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:11:20,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:11:20,800 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:11:20,800 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:11:20,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:11:20,801 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:11:21,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:11:21,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:11:21,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:11:21,096 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:11:21,096 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:11:21,097 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2020-10-06 01:11:21,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a40bb752/59c4bcb540d24f8ea1dcc8fa5594da51/FLAGb8e194bcb [2020-10-06 01:11:21,738 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:11:21,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2020-10-06 01:11:21,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a40bb752/59c4bcb540d24f8ea1dcc8fa5594da51/FLAGb8e194bcb [2020-10-06 01:11:22,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a40bb752/59c4bcb540d24f8ea1dcc8fa5594da51 [2020-10-06 01:11:22,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:11:22,047 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:11:22,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:11:22,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:11:22,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:11:22,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2ec795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22, skipping insertion in model container [2020-10-06 01:11:22,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:11:22,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:11:22,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:11:22,700 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:11:22,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:11:22,859 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:11:22,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22 WrapperNode [2020-10-06 01:11:22,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:11:22,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:11:22,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:11:22,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:11:22,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:11:22,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:11:22,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:11:22,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:11:22,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (1/1) ... [2020-10-06 01:11:22,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:11:22,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:11:22,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:11:22,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:11:22,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (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-06 01:11:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:11:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 01:11:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:11:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:11:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 01:11:23,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 01:11:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 01:11:23,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 01:11:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 01:11:23,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 01:11:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 01:11:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:11:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:11:23,068 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:11:25,086 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:11:25,087 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 01:11:25,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:11:25 BoogieIcfgContainer [2020-10-06 01:11:25,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:11:25,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:11:25,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:11:25,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:11:25,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:11:22" (1/3) ... [2020-10-06 01:11:25,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc6559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:11:25, skipping insertion in model container [2020-10-06 01:11:25,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:22" (2/3) ... [2020-10-06 01:11:25,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc6559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:11:25, skipping insertion in model container [2020-10-06 01:11:25,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:11:25" (3/3) ... [2020-10-06 01:11:25,098 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2020-10-06 01:11:25,109 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:11:25,109 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:11:25,117 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 01:11:25,118 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:11:25,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,151 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,154 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,154 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,157 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,158 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,165 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,165 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,171 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,172 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,172 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,174 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:25,191 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 01:11:25,213 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:11:25,213 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:11:25,213 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:11:25,213 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:11:25,213 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:11:25,214 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:11:25,214 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:11:25,214 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:11:25,230 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-06 01:11:25,232 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-06 01:11:25,279 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-06 01:11:25,279 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:11:25,284 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-06 01:11:25,288 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-06 01:11:25,309 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-06 01:11:25,309 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:11:25,310 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-06 01:11:25,313 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1650 [2020-10-06 01:11:25,315 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:11:25,724 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 01:11:26,205 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-06 01:11:27,383 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-06 01:11:27,483 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4355 [2020-10-06 01:11:27,483 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-06 01:11:27,486 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-10-06 01:11:27,560 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1124 states. [2020-10-06 01:11:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states. [2020-10-06 01:11:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:11:27,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:27,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:11:27,571 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1038226, now seen corresponding path program 1 times [2020-10-06 01:11:27,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:27,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745059338] [2020-10-06 01:11:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:27,798 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-06 01:11:27,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745059338] [2020-10-06 01:11:27,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:27,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:11:27,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [695051921] [2020-10-06 01:11:27,802 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:27,805 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:27,818 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:11:27,819 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:27,823 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:27,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:11:27,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:11:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:27,842 INFO L87 Difference]: Start difference. First operand 1124 states. Second operand 3 states. [2020-10-06 01:11:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:27,946 INFO L93 Difference]: Finished difference Result 937 states and 3000 transitions. [2020-10-06 01:11:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:11:27,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:11:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:27,977 INFO L225 Difference]: With dead ends: 937 [2020-10-06 01:11:27,977 INFO L226 Difference]: Without dead ends: 687 [2020-10-06 01:11:27,979 INFO L675 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-06 01:11:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-06 01:11:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-06 01:11:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-06 01:11:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-06 01:11:28,112 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-06 01:11:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:28,113 INFO L479 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-06 01:11:28,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:11:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-06 01:11:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:11:28,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:28,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:28,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:11:28,117 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:28,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1662846629, now seen corresponding path program 1 times [2020-10-06 01:11:28,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:28,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177074121] [2020-10-06 01:11:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:28,374 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-06 01:11:28,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177074121] [2020-10-06 01:11:28,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:28,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:11:28,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777529893] [2020-10-06 01:11:28,375 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:28,378 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:28,380 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-06 01:11:28,381 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:28,381 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:28,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:11:28,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:11:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:11:28,384 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-06 01:11:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:28,438 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-10-06 01:11:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:11:28,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-06 01:11:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:28,446 INFO L225 Difference]: With dead ends: 792 [2020-10-06 01:11:28,446 INFO L226 Difference]: Without dead ends: 667 [2020-10-06 01:11:28,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:11:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-10-06 01:11:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-10-06 01:11:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-10-06 01:11:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-10-06 01:11:28,475 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-10-06 01:11:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:28,476 INFO L479 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-10-06 01:11:28,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:11:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-10-06 01:11:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:11:28,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:28,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:28,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:11:28,480 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1067273529, now seen corresponding path program 1 times [2020-10-06 01:11:28,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:28,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773004905] [2020-10-06 01:11:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:28,725 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-06 01:11:28,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773004905] [2020-10-06 01:11:28,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:28,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:11:28,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [530937238] [2020-10-06 01:11:28,727 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:28,729 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:28,734 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-06 01:11:28,734 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:28,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:28,774 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:28,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:28,778 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:28,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:28,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:28,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:28,827 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:28,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:11:28,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:11:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:11:28,829 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 5 states. [2020-10-06 01:11:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:28,985 INFO L93 Difference]: Finished difference Result 786 states and 2348 transitions. [2020-10-06 01:11:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:11:28,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-06 01:11:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:28,991 INFO L225 Difference]: With dead ends: 786 [2020-10-06 01:11:28,991 INFO L226 Difference]: Without dead ends: 663 [2020-10-06 01:11:28,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:11:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-10-06 01:11:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2020-10-06 01:11:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2020-10-06 01:11:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 2030 transitions. [2020-10-06 01:11:29,018 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 2030 transitions. Word has length 11 [2020-10-06 01:11:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:29,019 INFO L479 AbstractCegarLoop]: Abstraction has 663 states and 2030 transitions. [2020-10-06 01:11:29,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:11:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 2030 transitions. [2020-10-06 01:11:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:11:29,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:29,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:29,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:11:29,022 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1488090115, now seen corresponding path program 1 times [2020-10-06 01:11:29,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:29,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723888720] [2020-10-06 01:11:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:29,114 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-06 01:11:29,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723888720] [2020-10-06 01:11:29,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:29,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:11:29,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53160929] [2020-10-06 01:11:29,116 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:29,119 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:29,126 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 43 transitions. [2020-10-06 01:11:29,127 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:29,183 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:29,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:11:29,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:11:29,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:11:29,185 INFO L87 Difference]: Start difference. First operand 663 states and 2030 transitions. Second operand 4 states. [2020-10-06 01:11:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:29,232 INFO L93 Difference]: Finished difference Result 1058 states and 3101 transitions. [2020-10-06 01:11:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:11:29,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-06 01:11:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:29,239 INFO L225 Difference]: With dead ends: 1058 [2020-10-06 01:11:29,239 INFO L226 Difference]: Without dead ends: 717 [2020-10-06 01:11:29,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-06 01:11:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2020-10-06 01:11:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 621. [2020-10-06 01:11:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2020-10-06 01:11:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1810 transitions. [2020-10-06 01:11:29,261 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1810 transitions. Word has length 13 [2020-10-06 01:11:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:29,262 INFO L479 AbstractCegarLoop]: Abstraction has 621 states and 1810 transitions. [2020-10-06 01:11:29,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:11:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1810 transitions. [2020-10-06 01:11:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:11:29,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:29,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:29,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:11:29,264 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1913955397, now seen corresponding path program 1 times [2020-10-06 01:11:29,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:29,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621261588] [2020-10-06 01:11:29,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:29,397 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-06 01:11:29,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621261588] [2020-10-06 01:11:29,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:29,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:11:29,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098431355] [2020-10-06 01:11:29,398 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:29,401 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:29,405 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 35 transitions. [2020-10-06 01:11:29,405 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:29,421 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:29,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:29,423 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:29,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:29,426 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:29,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:29,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:29,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:29,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:29,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:29,461 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:29,471 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:29,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:29,479 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:29,514 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:29,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:11:29,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:11:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:11:29,515 INFO L87 Difference]: Start difference. First operand 621 states and 1810 transitions. Second operand 6 states. [2020-10-06 01:11:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:29,686 INFO L93 Difference]: Finished difference Result 666 states and 1905 transitions. [2020-10-06 01:11:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:11:29,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-06 01:11:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:29,692 INFO L225 Difference]: With dead ends: 666 [2020-10-06 01:11:29,692 INFO L226 Difference]: Without dead ends: 606 [2020-10-06 01:11:29,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:11:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-10-06 01:11:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 597. [2020-10-06 01:11:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-06 01:11:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1728 transitions. [2020-10-06 01:11:29,721 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1728 transitions. Word has length 13 [2020-10-06 01:11:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:29,723 INFO L479 AbstractCegarLoop]: Abstraction has 597 states and 1728 transitions. [2020-10-06 01:11:29,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:11:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1728 transitions. [2020-10-06 01:11:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:11:29,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:29,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:29,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:11:29,726 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2122485023, now seen corresponding path program 1 times [2020-10-06 01:11:29,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:29,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43607909] [2020-10-06 01:11:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:29,866 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-06 01:11:29,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43607909] [2020-10-06 01:11:29,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:29,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:11:29,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [618026327] [2020-10-06 01:11:29,867 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:29,872 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:29,882 INFO L258 McrAutomatonBuilder]: Finished intersection with 46 states and 81 transitions. [2020-10-06 01:11:29,883 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:30,074 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:30,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:11:30,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:11:30,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:11:30,076 INFO L87 Difference]: Start difference. First operand 597 states and 1728 transitions. Second operand 4 states. [2020-10-06 01:11:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:30,116 INFO L93 Difference]: Finished difference Result 633 states and 1798 transitions. [2020-10-06 01:11:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:11:30,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-06 01:11:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:30,121 INFO L225 Difference]: With dead ends: 633 [2020-10-06 01:11:30,121 INFO L226 Difference]: Without dead ends: 593 [2020-10-06 01:11:30,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-06 01:11:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-06 01:11:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2020-10-06 01:11:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2020-10-06 01:11:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1714 transitions. [2020-10-06 01:11:30,142 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1714 transitions. Word has length 14 [2020-10-06 01:11:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:30,143 INFO L479 AbstractCegarLoop]: Abstraction has 593 states and 1714 transitions. [2020-10-06 01:11:30,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:11:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1714 transitions. [2020-10-06 01:11:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:11:30,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:30,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:30,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:11:30,145 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -183488500, now seen corresponding path program 1 times [2020-10-06 01:11:30,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:30,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131465417] [2020-10-06 01:11:30,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:30,320 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-06 01:11:30,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131465417] [2020-10-06 01:11:30,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:30,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:11:30,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [628596496] [2020-10-06 01:11:30,321 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:30,324 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:30,332 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 81 transitions. [2020-10-06 01:11:30,332 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:30,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 2, 2, 1] term [2020-10-06 01:11:30,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:30,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-06 01:11:30,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:30,348 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:30,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:30,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:30,557 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14923#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1))] [2020-10-06 01:11:30,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 01:11:30,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 01:11:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:11:30,558 INFO L87 Difference]: Start difference. First operand 593 states and 1714 transitions. Second operand 8 states. [2020-10-06 01:11:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:30,815 INFO L93 Difference]: Finished difference Result 717 states and 2038 transitions. [2020-10-06 01:11:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:11:30,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-06 01:11:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:30,821 INFO L225 Difference]: With dead ends: 717 [2020-10-06 01:11:30,821 INFO L226 Difference]: Without dead ends: 657 [2020-10-06 01:11:30,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-06 01:11:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-10-06 01:11:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 633. [2020-10-06 01:11:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-10-06 01:11:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1822 transitions. [2020-10-06 01:11:30,848 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1822 transitions. Word has length 14 [2020-10-06 01:11:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:30,849 INFO L479 AbstractCegarLoop]: Abstraction has 633 states and 1822 transitions. [2020-10-06 01:11:30,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 01:11:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1822 transitions. [2020-10-06 01:11:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:11:30,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:30,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:30,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:11:30,852 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1350841217, now seen corresponding path program 1 times [2020-10-06 01:11:30,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:30,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165846393] [2020-10-06 01:11:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:30,955 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-06 01:11:30,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165846393] [2020-10-06 01:11:30,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:30,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:11:30,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [653604236] [2020-10-06 01:11:30,957 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:30,960 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:30,973 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 62 transitions. [2020-10-06 01:11:30,974 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:31,073 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:31,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:11:31,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:11:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:11:31,074 INFO L87 Difference]: Start difference. First operand 633 states and 1822 transitions. Second operand 4 states. [2020-10-06 01:11:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:31,127 INFO L93 Difference]: Finished difference Result 1001 states and 2785 transitions. [2020-10-06 01:11:31,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:11:31,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-06 01:11:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:31,132 INFO L225 Difference]: With dead ends: 1001 [2020-10-06 01:11:31,133 INFO L226 Difference]: Without dead ends: 685 [2020-10-06 01:11:31,133 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-06 01:11:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-10-06 01:11:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 613. [2020-10-06 01:11:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2020-10-06 01:11:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1690 transitions. [2020-10-06 01:11:31,153 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1690 transitions. Word has length 14 [2020-10-06 01:11:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:31,153 INFO L479 AbstractCegarLoop]: Abstraction has 613 states and 1690 transitions. [2020-10-06 01:11:31,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:11:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1690 transitions. [2020-10-06 01:11:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:11:31,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:31,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:31,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:11:31,155 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1419876870, now seen corresponding path program 1 times [2020-10-06 01:11:31,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:31,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435911099] [2020-10-06 01:11:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:31,301 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-06 01:11:31,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435911099] [2020-10-06 01:11:31,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:31,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:11:31,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113909568] [2020-10-06 01:11:31,303 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:31,308 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:31,328 INFO L258 McrAutomatonBuilder]: Finished intersection with 64 states and 128 transitions. [2020-10-06 01:11:31,329 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:31,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,622 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:31,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:11:31,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:31,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:11:31,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:11:31,623 INFO L87 Difference]: Start difference. First operand 613 states and 1690 transitions. Second operand 4 states. [2020-10-06 01:11:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:31,656 INFO L93 Difference]: Finished difference Result 574 states and 1383 transitions. [2020-10-06 01:11:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:11:31,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-06 01:11:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:31,660 INFO L225 Difference]: With dead ends: 574 [2020-10-06 01:11:31,660 INFO L226 Difference]: Without dead ends: 429 [2020-10-06 01:11:31,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-06 01:11:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-10-06 01:11:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2020-10-06 01:11:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-10-06 01:11:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1010 transitions. [2020-10-06 01:11:31,674 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1010 transitions. Word has length 15 [2020-10-06 01:11:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:31,674 INFO L479 AbstractCegarLoop]: Abstraction has 429 states and 1010 transitions. [2020-10-06 01:11:31,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:11:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1010 transitions. [2020-10-06 01:11:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 01:11:31,675 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:31,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:31,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:11:31,676 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash 511082472, now seen corresponding path program 1 times [2020-10-06 01:11:31,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:31,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795267457] [2020-10-06 01:11:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:31,778 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-06 01:11:31,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795267457] [2020-10-06 01:11:31,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:31,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:11:31,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374612609] [2020-10-06 01:11:31,779 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:31,782 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:31,796 INFO L258 McrAutomatonBuilder]: Finished intersection with 62 states and 116 transitions. [2020-10-06 01:11:31,796 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:31,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:31,994 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20589#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 01:11:31,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:11:31,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:31,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:11:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:11:31,996 INFO L87 Difference]: Start difference. First operand 429 states and 1010 transitions. Second operand 6 states. [2020-10-06 01:11:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:32,039 INFO L93 Difference]: Finished difference Result 331 states and 703 transitions. [2020-10-06 01:11:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:11:32,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-06 01:11:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:32,042 INFO L225 Difference]: With dead ends: 331 [2020-10-06 01:11:32,042 INFO L226 Difference]: Without dead ends: 251 [2020-10-06 01:11:32,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:11:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-06 01:11:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2020-10-06 01:11:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-06 01:11:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 478 transitions. [2020-10-06 01:11:32,049 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 478 transitions. Word has length 16 [2020-10-06 01:11:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:32,049 INFO L479 AbstractCegarLoop]: Abstraction has 231 states and 478 transitions. [2020-10-06 01:11:32,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:11:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 478 transitions. [2020-10-06 01:11:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:11:32,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:32,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:32,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:11:32,051 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:32,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash -860249166, now seen corresponding path program 1 times [2020-10-06 01:11:32,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:32,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292881938] [2020-10-06 01:11:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:32,347 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-06 01:11:32,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292881938] [2020-10-06 01:11:32,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:32,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:11:32,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [427385376] [2020-10-06 01:11:32,349 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:32,352 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:32,370 INFO L258 McrAutomatonBuilder]: Finished intersection with 68 states and 125 transitions. [2020-10-06 01:11:32,370 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:32,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:32,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,398 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:32,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,400 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:32,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,403 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,409 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:32,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:32,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,415 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,432 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,449 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:32,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:32,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:32,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:32,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:32,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,483 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:32,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,484 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:32,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,528 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:32,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,529 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:32,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,531 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:32,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:32,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,538 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:32,542 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,554 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:32,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:32,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,576 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:32,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:32,598 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:11:32,602 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:32,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:32,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,619 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:32,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:32,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,633 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:32,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,641 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:32,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,647 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:32,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,683 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:32,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,685 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:32,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,701 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:32,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,766 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:11:32,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:32,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,831 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:32,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:32,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,853 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:11:32,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:32,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:32,915 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:32,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:33,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:33,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,043 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,048 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,068 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,074 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,088 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,106 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,120 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,130 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:33,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:33,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,173 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:33,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,175 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,176 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:33,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,223 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,305 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:11:33,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,330 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:11:33,334 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,351 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,358 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,394 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,446 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:33,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,459 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,468 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:33,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,474 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,483 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,516 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,521 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:33,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,525 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,533 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:33,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,548 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,553 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,592 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,652 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:11:33,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,663 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,674 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:33,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,711 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,718 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,729 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,747 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,766 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:33,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,822 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:33,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,823 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:33,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,829 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,833 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,842 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:33,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:33,857 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:33,860 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:33,866 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,873 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:33,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:11:33,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:33,973 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [21394#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (or (= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))), 21395#(or (and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)))] [2020-10-06 01:11:33,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:11:33,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:33,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:11:33,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-06 01:11:33,975 INFO L87 Difference]: Start difference. First operand 231 states and 478 transitions. Second operand 11 states. [2020-10-06 01:11:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:34,418 INFO L93 Difference]: Finished difference Result 325 states and 632 transitions. [2020-10-06 01:11:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:11:34,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-10-06 01:11:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:34,420 INFO L225 Difference]: With dead ends: 325 [2020-10-06 01:11:34,420 INFO L226 Difference]: Without dead ends: 245 [2020-10-06 01:11:34,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-10-06 01:11:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-06 01:11:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 215. [2020-10-06 01:11:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-06 01:11:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 428 transitions. [2020-10-06 01:11:34,427 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 428 transitions. Word has length 19 [2020-10-06 01:11:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:34,427 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 428 transitions. [2020-10-06 01:11:34,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:11:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 428 transitions. [2020-10-06 01:11:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:11:34,428 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:34,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:34,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 01:11:34,429 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:34,429 INFO L82 PathProgramCache]: Analyzing trace with hash -299840534, now seen corresponding path program 1 times [2020-10-06 01:11:34,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:34,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668817275] [2020-10-06 01:11:34,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:34,507 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-06 01:11:34,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668817275] [2020-10-06 01:11:34,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:34,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:11:34,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595824396] [2020-10-06 01:11:34,508 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:34,511 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:34,579 INFO L258 McrAutomatonBuilder]: Finished intersection with 90 states and 173 transitions. [2020-10-06 01:11:34,580 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:34,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:34,806 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [22173#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 01:11:34,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:11:34,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:11:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:11:34,807 INFO L87 Difference]: Start difference. First operand 215 states and 428 transitions. Second operand 7 states. [2020-10-06 01:11:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:34,858 INFO L93 Difference]: Finished difference Result 187 states and 373 transitions. [2020-10-06 01:11:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:11:34,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 01:11:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:34,860 INFO L225 Difference]: With dead ends: 187 [2020-10-06 01:11:34,860 INFO L226 Difference]: Without dead ends: 63 [2020-10-06 01:11:34,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:11:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-06 01:11:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-06 01:11:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-06 01:11:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-06 01:11:34,863 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-06 01:11:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:34,863 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-06 01:11:34,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:11:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-06 01:11:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-06 01:11:34,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:34,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:34,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 01:11:34,864 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:34,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash -692182232, now seen corresponding path program 1 times [2020-10-06 01:11:34,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:34,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733041436] [2020-10-06 01:11:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:11:34,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:11:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:11:34,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:11:35,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:11:35,024 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:11:35,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 01:11:35,045 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-06 01:11:35,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,052 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-06 01:11:35,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,054 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-06 01:11:35,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,054 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-06 01:11:35,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,055 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-06 01:11:35,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,055 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-06 01:11:35,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,056 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-06 01:11:35,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,056 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-06 01:11:35,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,057 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-06 01:11:35,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,057 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-06 01:11:35,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,057 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-06 01:11:35,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,058 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-06 01:11:35,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,059 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-06 01:11:35,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,059 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-06 01:11:35,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,060 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-06 01:11:35,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,060 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-06 01:11:35,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,060 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-06 01:11:35,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,061 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-06 01:11:35,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,061 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-06 01:11:35,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,062 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-06 01:11:35,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,066 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-06 01:11:35,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,067 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-06 01:11:35,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,067 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-06 01:11:35,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,067 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-06 01:11:35,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,068 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-06 01:11:35,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,068 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-06 01:11:35,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,068 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-06 01:11:35,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,069 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-06 01:11:35,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,069 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-06 01:11:35,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,069 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-06 01:11:35,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,070 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-06 01:11:35,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,070 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-06 01:11:35,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,070 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-06 01:11:35,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,071 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-06 01:11:35,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,071 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-06 01:11:35,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,072 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-06 01:11:35,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:35,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:11:35 BasicIcfg [2020-10-06 01:11:35,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:11:35,133 INFO L168 Benchmark]: Toolchain (without parser) took 13086.24 ms. Allocated memory was 138.9 MB in the beginning and 439.9 MB in the end (delta: 300.9 MB). Free memory was 100.5 MB in the beginning and 280.0 MB in the end (delta: -179.5 MB). Peak memory consumption was 121.4 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:35,134 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-06 01:11:35,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.87 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 157.9 MB in the end (delta: -57.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:35,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.45 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 154.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:35,136 INFO L168 Benchmark]: Boogie Preprocessor took 56.71 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:35,136 INFO L168 Benchmark]: RCFGBuilder took 2099.45 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 153.0 MB in the beginning and 173.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:35,137 INFO L168 Benchmark]: TraceAbstraction took 10040.25 ms. Allocated memory was 248.0 MB in the beginning and 439.9 MB in the end (delta: 191.9 MB). Free memory was 173.2 MB in the beginning and 280.0 MB in the end (delta: -106.8 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:35,142 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.87 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 157.9 MB in the end (delta: -57.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.45 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 154.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.71 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2099.45 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 153.0 MB in the beginning and 173.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10040.25 ms. Allocated memory was 248.0 MB in the beginning and 439.9 MB in the end (delta: 191.9 MB). Free memory was 173.2 MB in the beginning and 280.0 MB in the end (delta: -106.8 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 99 ProgramPointsBefore, 38 ProgramPointsAfterwards, 91 TransitionsBefore, 29 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 756 VarBasedMoverChecksPositive, 22 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4355 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L706] 0 int z = 0; [L707] 0 _Bool z$flush_delayed; [L708] 0 int z$mem_tmp; [L709] 0 _Bool z$r_buff0_thd0; [L710] 0 _Bool z$r_buff0_thd1; [L711] 0 _Bool z$r_buff0_thd2; [L712] 0 _Bool z$r_buff0_thd3; [L713] 0 _Bool z$r_buff1_thd0; [L714] 0 _Bool z$r_buff1_thd1; [L715] 0 _Bool z$r_buff1_thd2; [L716] 0 _Bool z$r_buff1_thd3; [L717] 0 _Bool z$read_delayed; [L718] 0 int *z$read_delayed_var; [L719] 0 int z$w_buff0; [L720] 0 _Bool z$w_buff0_used; [L721] 0 int z$w_buff1; [L722] 0 _Bool z$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L805] 0 pthread_t t2489; [L806] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] 0 pthread_t t2490; [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 2 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L737] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 0 pthread_t t2491; [L810] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L787] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L747] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L790] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 3 return 0; [L763] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L766] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L767] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 2 return 0; [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L820] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L823] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 0 z$flush_delayed = weak$$choice2 [L826] 0 z$mem_tmp = z [L827] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L827] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L828] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L829] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L830] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L831] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L831] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L832] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L832] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L833] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L835] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L835] 0 z = z$flush_delayed ? z$mem_tmp : z [L836] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 369 SDtfs, 431 SDslu, 736 SDs, 0 SdLazy, 360 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 242 SyntacticMatches, 17 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1124occurred 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.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 251 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 12433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...